BibSLEIGH — data type tag

data type

data type

Tag #data type

897 papers:

POPL-2020-JonesME #ad hoc: Partial type constructors: or, making ad hoc datatypes less ad hoc (MPJ, JGM, RAE), p. 28.
POPL-2020-MeyerW #lifecycle #memory management #pointer: Pointer life cycle types for lock-free data structures with memory reclamation (RM0, SW), p. 36.
POPL-2020-XieEO: Kind inference for datatypes (NX, RAE, BCdSO), p. 28.
ASPLOS-2020-MaZCSWQ #architecture #framework #implementation #named #performance #persistent #symmetry: AsymNVM: An Efficient Framework for Implementing Persistent Data Structures on Asymmetric NVM Architecture (TM, MZ, KC, ZS, YW, XQ), pp. 757–773.
ASPLOS-2020-MemaripourIS #named #performance #persistent: Pronto: Easy and Fast Persistence for Volatile Data Structures (AM, JI, SS), pp. 789–806.
CC-2020-FegadeW #analysis #modelling #pointer #scalability #semantics #using: Scalable pointer analysis of data structures using semantic models (PF, CW), pp. 39–50.
ICSME-2019-Shah #analysis #framework #performance: Lib Metamorphosis: A Performance Analysis Framework for Exchanging Data Structures in Performance Sensitive Applications (MDS), pp. 379–381.
FM-2019-DerrickDDSW #concurrent #correctness #persistent #verification: Verifying Correctness of Persistent Concurrent Data Structures (JD, SD, BD, GS, HW), pp. 179–195.
CIKM-2019-0002LG #performance #semistructured data: Efficient Join Processing Over Incomplete Data Streams (WR0, XL, KG), pp. 209–218.
CIKM-2019-KawabataMS #automation #mining: Automatic Sequential Pattern Mining in Data Streams (KK, YM, YS), pp. 1733–1742.
KDD-2019-FedoryszakFRZ #detection #realtime #social: Real-time Event Detection on Social Data Streams (MF, BF, VR, CZ), pp. 2774–2782.
KDD-2019-HulsebosHBZSKDH #approach #detection #learning #named #semantics: Sherlock: A Deep Learning Approach to Semantic Data Type Detection (MH, KZH, MAB, EZ, AS, TK, ÇD, CAH), pp. 1500–1508.
KDD-2019-MatsubaraS #modelling: Dynamic Modeling and Forecasting of Time-evolving Data Streams (YM, YS), pp. 458–468.
OOPSLA-2019-KakiPSJ: Mergeable replicated data types (GK, SP, KCS, SJ), p. 29.
OOPSLA-2019-WangCMH #c #source code: Certifying graph-manipulating C programs via localizations within data structures (SW, QC, AM, AH), p. 30.
POPL-2019-MeyerW #memory management #static analysis: Decoupling lock-free data structures from memory reclamation for static analysis (RM0, SW), p. 31.
POPL-2019-MorrisM: Abstracting extensible data types: or, rows by any other name (JGM, JM), p. 28.
ICSE-2019-HuangLKSHLW #using: Distilling neural representations of data structure manipulation using fMRI and fNIRS (YH0, XL, RK, TS, XH, KL, WW), pp. 396–407.
ICSE-2019-MolinaDPRAF #classification #invariant: Training binary classifiers as data structure invariants (FM, RD, PP, GR, NA, MFF), pp. 759–770.
CAV-2019-BiswasEE #complexity #consistency #on the: On the Complexity of Checking Consistency for Replicated Data Types (RB, ME, CE), pp. 324–343.
CIKM-2018-GaikwadMA #performance #query: Data Structure for Efficient Line of Sight Queries (SG, MM, DCA), pp. 1535–1538.
ICML-2018-BoracchiCCM #detection #multi #named: QuantTree: Histograms for Change Detection in Multivariate Data Streams (GB, DC, CC, DM), pp. 638–647.
ICML-2018-BravermanCKLWY #matrix #multi #performance: Matrix Norms in Data Streams: Faster, Multi-Pass and Row-Order (VB, SRC, RK, YL0, DPW, LFY), pp. 648–657.
ICML-2018-Norouzi-FardTMZ #approximate: Beyond 1/2-Approximation for Submodular Maximization on Massive Data Streams (ANF, JT, SM, AZ, AM, OS), pp. 3826–3835.
ICML-2018-WagnerGKM #learning: Semi-Supervised Learning on Data Streams via Temporal Label Propagation (TW, SG, SPK, NM), pp. 5082–5091.
KDD-2018-0003GZZSL #named: HeavyGuardian: Separate and Guard Hot Items in Data Streams (TY0, JG, HZ, LZ0, LS, XL), pp. 2584–2593.
KDD-2018-NaKY #detection #effectiveness #memory management #named #performance: DILOF: Effective and Memory Efficient Local Outlier Detection in Data Streams (GSN, DHK, HY), pp. 1993–2002.
ECMFA-2018-BertoaMBBTV #metric #nondeterminism #ocl #uml: Expressing Measurement Uncertainty in OCL/UML Datatypes (MFB, NM, GB, LB, JT, AV), pp. 46–62.
Onward-2018-OkaMA #programming #visualisation: Live, synchronized, and mental map preserving visualization for data structure programming (AO, HM, TA), pp. 72–87.
OOPSLA-2018-Cohen #memory management: Every data structure deserves lock-free memory reclamation (NC), p. 24.
POPL-2018-KrishnaSW #abstraction #composition #concurrent: Go with the flow: compositional abstractions for concurrent data structures (SK, DES, TW), p. 31.
ESEC-FSE-2018-BasiosLWKB: Darwinian data structure selection (MB, LL, FW, LK, ETB), pp. 118–128.
ICSE-2018-LoncaricET #synthesis: Generalized data structure synthesis (CL, MDE, ET), pp. 958–968.
CASE-2018-WangKZY #concept #detection #learning #multi: A Multiscale Concept Drift Detection Method for Learning from Data Streams (XW, QK, MZ, SY), pp. 786–790.
CC-2018-KastrinisBFPS #alias #analysis #performance: An efficient data structure for must-alias analysis (GK, GB, KF, NPK, YS), pp. 48–58.
ESOP-2018-OstermannJ #algebra #matrix: Dualizing Generalized Algebraic Data Types by Matrix Transposition (KO, JJ), pp. 60–85.
IJCAR-2018-BlanchettePR: Superposition with Datatypes and Codatatypes (JCB, NP, SR), pp. 370–387.
IJCAR-2018-ReynoldsVBTB: Datatypes with Shared Selectors (AR, AV, HB, CT, CWB), pp. 591–608.
Haskell-2017-ChenCN #adaptation #concurrent #haskell #implementation: Adaptive lock-free data structures in Haskell: a general method for concurrent implementation swapping (CHC, VC, RRN), pp. 197–211.
ICML-2017-BravermanFLSY #clustering: Clustering High Dimensional Dynamic Data Streams (VB, GF, HL, CS, LFY), pp. 576–585.
ICML-2017-MasegosaNLRSM #modelling: Bayesian Models of Data Streams with Hierarchical Power Priors (ARM, TDN, HL, DRL, AS, ALM), pp. 2334–2343.
KDD-2017-BifetZFHZQHP #evolution #mining #performance: Extremely Fast Decision Tree Mining for Evolving Data Streams (AB, JZ, WF0, CH, JZ, JQ, GH0, BP), pp. 1733–1742.
KDD-2017-QuiselFSK: Collecting and Analyzing Millions of mHealth Data Streams (TQ, LF, AS, DCK), pp. 1971–1980.
ECOOP-2017-CastegrenW #linear: Relaxed Linear References for Lock-free Data Structures (EC, TW), p. 32.
ECOOP-2017-DelbiancoSNB #concurrent: Concurrent Data Structures Linked in Time (GAD, IS, AN, AB0), p. 30.
ASE-2017-RupprechtC0BLB #c #c++ #identification #named: DSIbin: identifying dynamic data structures in C/C++ binaries (TR, XC0, DHW0, JHB, GL, HB), pp. 331–341.
ASPLOS-2017-CalciuSBA #architecture #black box #concurrent: Black-box Concurrent Data Structures for NUMA Architectures (IC, SS0, MB0, MKA), pp. 207–221.
CASE-2017-XianWL #adaptation #big data #monitoring #online #parametricity: A nonparametric adaptive sampling strategy for online monitoring of big data streams (XX, AW, KL), pp. 844–846.
CC-2017-JaberK #clustering: Data structure-aware heap partitioning (NJ, MK0), pp. 109–119.
CAV-2017-BasinKZ #runtime #verification: Runtime Verification of Temporal Properties over Out-of-Order Data Streams (DAB, FK, EZ), pp. 356–376.
ICST-2017-XuLC #concurrent #debugging #testing #using: Using Delta Debugging to Minimize Stress Tests for Concurrent Data Structures (JX, YL, RHC), pp. 35–46.
EDM-2016-FouhFHKS #data analysis #topic #using: Investigating Difficult Topics in a Data Structures Course Using Item Response Theory and Logged Data Analysis (EF, MFF, SH, KHK, CAS), pp. 370–375.
EDM-2016-LiuDS #data-driven #multi #towards #using: Beyond Log Files: Using Multi-Modal Data Streams Towards Data-Driven KC Model Improvement (RL0, JLD, JCS), pp. 436–441.
FSCD-2016-Nipkow #analysis #functional: Verified Analysis of Functional Data Structures (TN), p. 2.
ICFP-2016-McDonellZCN #named: Ghostbuster: a tool for simplifying and converting GADTs (TLM, TAKZ, MC, RRN), pp. 338–350.
ICFP-2016-ThibodeauCP: Indexed codata types (DT, AC, BP), pp. 351–363.
CIKM-2016-BonabC #classification #framework #online: A Theoretical Framework on the Ideal Number of Classifiers for Online Ensembles in Data Streams (HRB, FC), pp. 2053–2056.
CIKM-2016-NadungodageXL #framework #mining #named: GStreamMiner: A GPU-accelerated Data Stream Mining Framework (CHN, YX, JJL), pp. 2489–2492.
CIKM-2016-WangMGWY #distributed #framework #named #resource management: OrientStream: A Framework for Dynamic Resource Allocation in Distributed Data Stream Management Systems (CW, XM0, QG, ZW, CY), pp. 2281–2286.
ICML-2016-AdamsSTPKM #random #smarttech: Hierarchical Span-Based Conditional Random Fields for Labeling and Segmenting Events in Wearable Sensor Data Streams (RJA, NS, ET, AP, SK0, BMM), pp. 334–343.
ICPR-2016-BarddalGBE #benchmark #classification #metric: A benchmark of classifiers on feature drifting data streams (JPB, HMG, AdSBJ, FE), pp. 2180–2185.
KDD-2016-MoralesBKGF #big data #mining: IoT Big Data Stream Mining (GDFM, AB, LK, JG, WF0), pp. 2119–2120.
PADL-2016-SerranoH #haskell #regular expression: Generic Matching of Tree Regular Expressions over Haskell Data Types (AS0, JH), pp. 83–98.
PLDI-2016-SpiegelmanGK #library #transaction: Transactional data structure libraries (AS, GGG, IK), pp. 682–696.
POPL-2016-0008E #type inference: Principal type inference for GADTs (SC0, ME), pp. 416–428.
POPL-2016-CaiGO #programming #recursion: System f-omega with equirecursive types for datatype-generic programming (YC, PGG, KO), pp. 30–43.
POPL-2016-EmmiE #type inference: Symbolic abstract data type inference (ME, CE), pp. 513–525.
POPL-2016-RobbinsKS #decompiler #recursion #semantics: From MinX to MinC: semantics-driven decompilation of recursive datatypes (ER, AK, TS), pp. 191–203.
POPL-2016-SinghG #spreadsheet #using: Transforming spreadsheet data types using examples (RS, SG), pp. 343–356.
FSE-2016-Loncaric #synthesis: Data structure synthesis (CL), pp. 1073–1075.
FSE-2016-Loncaric16a #named: Cozy: synthesizing collection data structures (CL), pp. 1103–1105.
CC-2016-KusumNG #adaptation #flexibility: Safe and flexible adaptation via alternate data structure representations (AK, IN, RG0), pp. 34–44.
CC-2016-SinghGN #automation #fault: Automatic fault location for data structures (VS, RG0, IN), pp. 99–109.
ESOP-2016-AlurFR #programming: Regular Programming for Quantitative Properties of Data Streams (RA, DF, MR), pp. 15–40.
VMCAI-2016-BakstJ #abstraction #linked data #open data: Predicate Abstraction for Linked Data Structures (AB, RJ), pp. 65–84.
PODS-2015-MunroNV #documentation #graph: Dynamic Data Structures for Document Collections and Graphs (JIM, YN, JSV), pp. 277–289.
SIGMOD-2015-JiZJNHF #execution #quality #query: Quality-Driven Continuous Query Execution over Out-of-Order Data Streams (YJ, HZ, ZJ, AN, GH, CF), pp. 889–894.
SIGMOD-2015-KatsipoulakisTG #named: CE-Storm: Confidential Elastic Processing of Data Streams (NRK, CT, EAG, AL, AJL, PKC), pp. 859–864.
ITiCSE-2015-MishraI #student: Question-Posing strategies used by students for exploring Data Structures (SM, SI), pp. 171–176.
SANER-2015-SinghGN #graph #memory management: MG++: Memory graphs for analyzing dynamic data structures (VS, RG, IN), pp. 291–300.
ICALP-v1-2015-WeinsteinW #communication: The Simultaneous Communication of Disjointness with Applications to Data Streams (OW, DPW), pp. 1082–1093.
LATA-2015-BilleGV: Compressed Data Structures for Range Searching (PB, ILG, SV), pp. 577–586.
ICFP-2015-JaskelioffR #functional: Functional pearl: a smart view on datatypes (MJ, ER), pp. 355–361.
ICFP-2015-KarachaliasSVJ #lazy evaluation #pattern matching: GADTs meet their match: pattern-matching warnings that account for GADTs, guards, and laziness (GK, TS, DV, SLPJ), pp. 424–436.
CHI-2015-OuVH #development #interactive: An Interactive System for Data Structure Development (JO, MTV, OH), pp. 3053–3062.
CIKM-2015-ChenSJ #analysis #infinity: Private Analysis of Infinite Data Streams via Retroactive Grouping (RC, YS, HJ), pp. 1061–1070.
CIKM-2015-HaoZHM #learning #online #similarity: Learning Relative Similarity from Data Streams: Active Online Learning Approaches (SH, PZ, SCHH, CM), pp. 1181–1190.
CIKM-2015-HuangLY #approach #clustering #parallel #performance: A Parallel GPU-Based Approach to Clustering Very Fast Data Streams (PH, XL, BY0), pp. 23–32.
CIKM-2015-HuangYK #feature model: Unsupervised Feature Selection on Data Streams (HH, SY, SPK), pp. 1031–1040.
CIKM-2015-KutzkovAN #estimation #similarity: Weighted Similarity Estimation in Data Streams (KK, MA, SN), pp. 1051–1060.
ICML-2015-AhnCGMW #clustering #correlation: Correlation Clustering in Data Streams (KJA, GC, SG, AM, AW), pp. 2237–2246.
KDD-2015-BifetMRHP #big data #classification #evaluation #online #performance: Efficient Online Evaluation of Big Data Stream Classifiers (AB, GDFM, JR, GH, BP), pp. 59–68.
KDD-2015-QahtanAWZ #detection #framework #multi: A PCA-Based Change Detection Framework for Multidimensional Data Streams: Change Detection in Multidimensional Data Streams (AAQ, BA, SW, XZ), pp. 935–944.
RecSys-2015-Ludmann #online #recommendation: Online Recommender Systems based on Data Stream Management Systems (CAL), pp. 391–394.
SIGIR-2015-AlbakourMO #identification #metadata #topic #using: Using Sensor Metadata Streams to Identify Topics of Local Events in the City (MDA, CM, IO), pp. 711–714.
Onward-2015-WaelMKSM: Just-in-time data structures (MDW, SM, JDK, JBS, WDM), pp. 61–75.
OOPSLA-2015-0003KLS #memory management #multi #performance #scalability: Fast, multicore-scalable, low-fragmentation memory allocation through large virtual memory and global data structures (MA, CMK, ML, AS), pp. 451–469.
OOPSLA-2015-CohenP #automation #memory management: Automatic memory reclamation for lock-free data structures (NC, EP), pp. 260–279.
PLDI-2015-FeserCD: Synthesizing data structure transformations from input-output examples (JKF, SC, ID), pp. 229–239.
POPL-2015-DelawarePGC #deduction #named #proving #synthesis: Fiat: Deductive Synthesis of Abstract Data Types in a Proof Assistant (BD, CPC, JG, AC), pp. 689–700.
POPL-2015-SekiyamaNI #contract: Manifest Contracts for Datatypes (TS, YN, AI), pp. 195–207.
ICSE-v1-2015-DeweyNH #automation #generative: Automated Data Structure Generation: Refuting Common Wisdom (KD, LN, BH), pp. 32–43.
SAC-2015-BarddalGE #algorithm #clustering #named #social: SNCStream: a social network-based data stream clustering algorithm (JPB, HMG, FE), pp. 935–940.
SAC-2015-GomesBE #classification #learning: Pairwise combination of classifiers for ensemble learning on data streams (HMG, JPB, FE), pp. 941–946.
SAC-2015-JoselliJC #animation #gpu #named #proximity: NGrid: a proximity data structure for fluids animation with GPU computing (MJ, JRdSJ, EC), pp. 1303–1308.
SAC-2015-PapeBH #adaptation #execution #optimisation #performance: Adaptive just-in-time value class optimization: transparent data structure inlining for fast execution (TP, CFB, RH), pp. 1970–1977.
SAC-2015-ReadPB #learning: Deep learning in partially-labeled data streams (JR, FPC, AB), pp. 954–959.
SAC-2015-Usener #assessment #automation #education #named: EASy-DSBuilder: automated assessment of tree data structures in computer science teaching (CAU), pp. 220–226.
ASPLOS-2015-DavidGT #concurrent #scalability: Asynchronized Concurrency: The Secret to Scaling Concurrent Search Data Structures (TD, RG, VT), pp. 631–644.
DATE-2015-KanounS #big data #concept #detection #learning #online #scheduling #streaming: Big-data streaming applications scheduling with online learning and concept drift detection (KK, MvdS), pp. 1547–1550.
ISMM-2015-CohenP #garbage collection: Data structure aware garbage collector (NC, EP), pp. 28–40.
ESOP-2015-Blanchette0T: Witnessing (Co)datatypes (JCB, AP, DT), pp. 359–382.
ESOP-2015-GotsmanY: Composite Replicated Data Types (AG, HY), pp. 585–609.
ESOP-2015-Ricciotti: Binding Structures as an Abstract Data Type (WR), pp. 762–786.
FASE-2015-AndriescuMI #automaton #using: Composing Message Translators and Inferring Their Data Types Using Tree Automata (EA, TM, VI), pp. 35–50.
CADE-2015-ReynoldsB #smt: A Decision Procedure for (Co)datatypes in SMT Solvers (AR, JCB), pp. 197–213.
VMCAI-2015-MukundRS #bound #implementation: Bounded Implementations of Replicated Data Types (MM, GSR, SPS), pp. 355–372.
SIGMOD-2014-YamamotoIF #approximate #mining: Resource-oriented approximation for frequent itemset mining from bursty data streams (YY, KI, SF), pp. 205–216.
VLDB-2014-CaoWR #big data #interactive: Interactive Outlier Exploration in Big Data Streams (LC, QW, EAR), pp. 1621–1624.
EDM-2014-GrafsgaardWBWL #learning #multimodal #predict #tutorial: Predicting Learning and Affect from Multimodal Data Streams in Task-Oriented Tutorial Dialogue (JFG, JBW, KEB, ENW, JCL), pp. 122–129.
ICPC-2014-White #identification #named: dsOli: data structure operation location and identification (DHW), pp. 48–52.
ICALP-v1-2014-ReingoldRW #graph #pseudo: Pseudorandom Graphs in Data Structures (OR, RDR, UW), pp. 943–954.
ICALP-v1-2014-WangY: Certificates in Data Structures (YW, YY), pp. 1039–1050.
IFM-2014-CalvaneseKSVZ #analysis: Shape and Content — A Database-Theoretic Perspective on the Analysis of Data Structures (DC, TK, MS, HV, FZ), pp. 3–17.
RTA-TLCA-2014-EscardoS #type system: Abstract Datatypes for Real Numbers in Type Theory (MHE, AS), pp. 208–223.
IFL-2014-KoopmanPJ #encoding #functional #harmful #implementation: Church Encoding of Data Types Considered Harmful for Implementations: Functional Pearl (PWMK, RP, JMJ), p. 4.
HIMI-DE-2014-SutoPK #collaboration #design #multi: A Collaboration Support Tool for Multi-cultural Design Team Based on Extended ADT Model (HS, PP, NK), pp. 548–557.
CIKM-2014-BoghCSA #named: Hashcube: A Data Structure for Space- and Query-Efficient Skycube Compression (KSB, SC, DS, IA), pp. 1767–1770.
CIKM-2014-ChatzistergiouV #clustering #heuristic #performance: Fast Heuristics for Near-Optimal Task Allocation in Data Stream Processing over Clusters (AC, SDV), pp. 1579–1588.
CIKM-2014-ChenC #incremental #matrix #named: GI-NMF: Group Incremental Non-Negative Matrix Factorization on Data Streams (XC, KSC), pp. 1119–1128.
CIKM-2014-LimCK #performance: Fast, Accurate, and Space-efficient Tracking of Time-weighted Frequent Items from Data Streams (YL, JC, UK), pp. 1109–1118.
CIKM-2014-ZhaoCN #approach #probability: Truth Discovery in Data Streams: A Single-Pass Probabilistic Approach (ZZ, JC, WN), pp. 1589–1598.
ICPR-2014-BougueliaBB #classification #detection #novel #performance: Efficient Active Novel Class Detection for Data Stream Classification (MRB, YB, AB), pp. 2826–2831.
KDD-2014-ShaoAK #concept #learning #prototype: Prototype-based learning on concept-drifting data streams (JS, ZA, SK), pp. 412–421.
MLDM-2014-BaroutiKKM #clustering #distributed #monitoring: Monitoring Distributed Data Streams through Node Clustering (MB, DK, JK, YM), pp. 149–162.
MLDM-2014-WaiyamaiKSR #classification #concept #named: ACCD: Associative Classification over Concept-Drifting Data Streams (KW, TK, BS, TR), pp. 78–90.
ECOOP-2014-GramoliG #concurrent #reuse: Reusable Concurrent Data Types (VG, RG), pp. 182–206.
Onward-2014-WalkingshawKEAB #trade-off #variability: Variational Data Structures: Exploring Tradeoffs in Computing with Variability (EW, CK, ME, SA, EB), pp. 213–226.
OOPSLA-2014-HolkNSL #gpu #memory management #programming language: Region-based memory management for GPU programming languages: enabling rich data structures on a spartan host (EH, RN, JGS, AL), pp. 141–155.
PLDI-2014-PekQM #c #logic #proving #using: Natural proofs for data structure manipulation in C using separation logic (EP, XQ, PM), p. 46.
POPL-2014-BurckhardtGYZ #specification #verification: Replicated data types: specification, verification, optimality (SB, AG, HY, MZ), pp. 271–284.
POPL-2014-MillerHKS #authentication: Authenticated data structures, generically (AM, MH, JK, ES), pp. 411–424.
SAC-2014-GomesE #adaptation #classification #named #social: SAE2: advances on the social adaptive ensemble classifier for data streams (HMG, FE), pp. 798–804.
SAC-2014-IencoBPP #category theory #detection #evolution: Change detection in categorical evolving data streams (DI, AB, BP, PP), pp. 792–797.
PPoPP-2014-0003VTCT #scheduling: Data structures for task-based priority scheduling (MW, FV, JLT, DC, PT), pp. 379–380.
PPoPP-2014-AgrawalFSSU #parallel #scheduling #source code: Provably good scheduling for parallel programs that use data structures through implicit batching (KA, JTF, BS, JS, RU), pp. 389–390.
PPoPP-2014-TimnatP #simulation: A practical wait-free simulation for lock-free data structures (ST, EP), pp. 357–368.
CAV-2014-LesaniMP #automation #concurrent #verification: Automatic Atomicity Verification for Clients of Concurrent Data Structures (ML, TDM, JP), pp. 550–567.
CAV-2014-SanchezS #concurrent #named #verification: LEAP: A Tool for the Parametrized Verification of Concurrent Datatypes (AS, CS), pp. 620–627.
CBSE-2013-BurtonS #correctness #mixin #using: Correctness of intrusive data structures using mixins (EB, ES), pp. 53–58.
SIGMOD-2013-AnanthanarayananBDGJQRRSV #fault tolerance #named #scalability: Photon: fault-tolerant and scalable joining of continuous data streams (RA, VB, SD, AG, HJ, TQ, AR, DR, MS, SV), pp. 577–588.
SIGMOD-2013-GeorgiadisKGPTM #algorithm #detection #framework #state of the art: Continuous outlier detection in data streams: an extensible framework and state-of-the-art algorithms (DG, MK, AG, ANP, KT, YM), pp. 1061–1064.
SIGMOD-2013-GolabJ: Data stream warehousing (LG, TJ), pp. 949–952.
SIGMOD-2013-Horikawa #design #evaluation #implementation: Latch-free data structures for DBMS: design, implementation, and evaluation (TH), pp. 409–420.
SIGMOD-2013-KaufmannMVFKFM #query #timeline: Timeline index: a unified data structure for processing queries on temporal data in SAP HANA (MK, AAM, PV, PMF, DK, FF, NM), pp. 1173–1184.
SIGMOD-2013-PapadopoulosCDG #algebra #authentication #lightweight #linear #query: Lightweight authentication of linear algebraic queries on data streams (SP, GC, AD, MNG), pp. 881–892.
SIGMOD-2013-WangLYC #case study: Quantiles over data streams: an experimental study (LW, GL, KY, GC), pp. 737–748.
VLDB-2013-DuttaNB #approach #approximate #detection #streaming: Streaming Quotient Filter: A Near Optimal Approximate Duplicate Detection Approach for Data Streams (SD, AN, SKB), pp. 589–600.
VLDB-2013-YangZHLRW #mining: Mining and Linking Patterns across Live Data Streams and Stream Archives (DY, KZ, MH, HL, EAR, MOW), pp. 1346–1349.
ITiCSE-2013-BryfczynskiPCKD #education: Teaching data structures with beSocratic (SB, RPP, MC, MK, BCD), pp. 105–110.
WCRE-2013-HallerSB #c #c++ #detection #named: MemPick: High-level data structure detection in C/C++ binaries (IH, AS, HB), pp. 32–41.
WCRE-2013-HallerSB13a #detection #named: MemPick: A tool for data structure detection (IH, AS, HB), pp. 479–480.
ICALP-v2-2013-ImNP #parametricity #recursion: Contractive Signatures with Recursive Types, Type Parameters, and Abstract Types (HI, KN, SP), pp. 299–311.
EDOC-2013-BerryM #health #legacy #monitoring #quality #realtime: Real-Time Analytics for Legacy Data Streams in Health: Monitoring Health Data Quality (AB, ZM), pp. 91–100.
EDOC-2013-SousaMGM #approach #architecture #enterprise #risk management #using: Assessing Risks and Opportunities in Enterprise Architecture Using an Extended ADT Approach (SS, DM, KG, NM), pp. 81–90.
ICEIS-v1-2013-CazzolatoRYS #algorithm #classification #statistics: A Statistical Decision Tree Algorithm for Data Stream Classification (MTC, MXR, CAY, MTPS), pp. 217–223.
CIKM-2013-ChengCLWAC #learning #multi: Feedback-driven multiclass active learning for data streams (YC, ZC, LL, JW, AA, ANC), pp. 1311–1320.
CIKM-2013-DerakhshanSS #performance #streaming: A new operator for efficient stream-relation join processing in data streaming engines (RD, AS, BS), pp. 793–798.
KEOD-2013-AlirezaieL #abduction #automation #reasoning #using: Automatic Annotation of Sensor Data Streams using Abductive Reasoning (MA, AL), pp. 345–354.
OOPSLA-2013-NorrisD #c #c++ #concurrent #named: CDSchecker: checking concurrent data structures written with C/C++ atomics (BN, BD), pp. 131–150.
PLDI-2013-ElwazeerAKSB #detection #scalability: Scalable variable and data type detection in a binary rewriter (KE, KA, AK, MS, RB), pp. 51–60.
PLDI-2013-YuKL #multi #thread: General data structure expansion for multi-threading (HY, HJK, ZL), pp. 243–252.
POPL-2013-HenzingerKPSS #concurrent: Quantitative relaxation of concurrent data structures (TAH, CMK, HP, AS, AS), pp. 317–328.
POPL-2013-HoborV: The ramifications of sharing in data structures (AH, JV), pp. 523–536.
POPL-2013-RompfSABJLJOO #compilation #optimisation #source code #staging: Optimizing data structures in high-level programs: new directions for extensible compilers based on staging (TR, AKS, NA, KJB, VJ, HL, MJ, KO, MO), pp. 497–510.
PPDP-2013-Holdermans #functional #guidelines #random testing #testing: Random testing of purely functional abstract datatypes: guidelines for dealing with operation invariance (SH), pp. 275–284.
PPDP-2013-StewartBN #data flow #dependent type #policy #semistructured data: Dependent types for enforcement of information flow and erasure policies in heterogeneous data structures (GS, AB, AN), pp. 145–156.
SAS-2013-DragoiES #analysis: Local Shape Analysis for Overlaid Data Structures (CD, CE, MS), pp. 150–171.
ASE-2013-OsterlundL: Dynamically transforming data structures (EÖ, WL), pp. 410–420.
ASE-2013-ZhangCW #concurrent #named #runtime: Round-up: Runtime checking quasi linearizability of concurrent data structures (LZ, AC, CW), pp. 4–14.
ESEC-FSE-2013-PhamW #abstraction #algebra #named #reasoning: RADA: a tool for reasoning about algebraic data types with abstractions (THP, MWW), pp. 611–614.
SAC-2013-AlmeidaKG #random: Random rules from data streams (EA, PK, JG), pp. 813–814.
SAC-2013-BifetPRH #adaptation #classification #performance #probability: Efficient data stream classification via probabilistic adaptive windows (AB, BP, JR, GH), pp. 801–806.
SAC-2013-FariaGC #algorithm #detection #multi #problem: Novelty detection algorithm for data streams multi-class problems (ERF, JG, ACPLFC), pp. 795–800.
SAC-2013-GholipourHB #adaptation: An adaptive regression tree for non-stationary data streams (AG, MJH, HB), pp. 815–817.
SAC-2013-KawakamiIYT #communication #delivery: A delivery method considering communication loads for sensor data stream with different collection cycles (TK, YI, TY, YT), pp. 611–618.
SAC-2013-KumarR #algorithm #identification #online: Online identification of frequently executed acyclic paths by leveraging data stream algorithms (GK, SR), pp. 1694–1695.
SAC-2013-ZhangHMZMM #mining: Mining frequent itemsets over tuple-evolving data streams (CZ, YH, MM, CZ, HM, FM), pp. 267–274.
GPCE-2013-KurilovaR #linked data #on the #open data: On the simplicity of synthesizing linked data structure operations (DK, DR), pp. 155–158.
CGO-2013-RenALMPS #parallel: SIMD parallelization of applications that traverse irregular data structures (BR, GA, JRL, TM, TP, WS), p. 10.
PDP-2013-FariaSS #layout #performance: Impact of Data Structure Layout on Performance (NF, RCS, JLS), pp. 116–120.
PPoPP-2013-XiangS #compilation #concurrent #performance: Compiler aided manual speculation for high performance concurrent data structures (LX, MLS), pp. 47–56.
SOSP-2013-BalakrishnanMWWPWDRZZ #distributed #named: Tango: distributed data structures over a shared log (MB, DM, TW, MW, VP, MW, JDD, SR, TZ, AZ), pp. 325–340.
ESOP-2013-SchererR #type system: GADTs Meet Subtyping (GS, DR), pp. 554–573.
ESOP-2013-SvendsenBP #composition #concurrent #reasoning: Modular Reasoning about Separation of Concurrent Data Structures (KS, LB, MJP), pp. 169–188.
TACAS-2013-AbdullaHHJR #concurrent #specification #verification: An Integrated Specification and Verification Technique for Highly Concurrent Data Structures (PAA, FH, LH, BJ, AR), pp. 324–338.
TACAS-2013-WhiteL #evolution #identification #in memory #learning #memory management: Identifying Dynamic Data Structures by Learning Evolving Patterns in Memory (DHW, GL), pp. 354–369.
CAV-2013-0001LMN #invariant #learning #linear #quantifier: Learning Universally Quantified Invariants of Linear Data Structures (PG, CL, PM, DN), pp. 813–829.
CAV-2013-ItzhakyBINS #effectiveness #linked data #open data #reachability #reasoning: Effectively-Propositional Reasoning about Reachability in Linked Data Structures (SI, AB, NI, AN, MS), pp. 756–772.
LICS-2013-GhaniMFS: Fibred Data Types (NG, LM, FNF, AS), pp. 243–252.
PODS-2012-TirthapuraW: Rectangle-efficient aggregation in spatial data streams (ST, DPW), pp. 283–294.
SIGMOD-2012-GiatrakosDGSS #distributed #geometry #monitoring #predict: Prediction-based geometric monitoring over distributed data streams (NG, AD, MNG, IS, AS), pp. 265–276.
VLDB-2012-MankuM #approximate: Approximate Frequency Counts over Data Streams (GSM, RM), p. 1699.
VLDB-2012-PapapetrouGD #distributed #query #sketching: Sketch-based Querying of Distributed Sliding-Window Data Streams (OP, MNG, AD), pp. 992–1003.
CSEET-2012-Virseda #algebra #implementation #specification #testing #verification: A Software Testing Tool for the Verification of Abstract Data Type Implementations from Formal Algebraic Specifications (RdVV), pp. 100–104.
ITiCSE-2012-Khalifa: Intuitive thinking while dealing with abstract data types (WK), p. 391.
ICALP-v2-2012-KaneMSS: Counting Arbitrary Subgraphs in Data Streams (DMK, KM, TS, HS), pp. 598–609.
CIKM-2012-PanZ #correlation #graph #named #query: CGStream: continuous correlated graph query for data streams (SP, XZ), pp. 1183–1192.
CIKM-2012-Vitter: Compressed data structures with relevance (JSV), pp. 4–5.
CIKM-2012-XieZSzP #linear #multi #performance #representation: Efficient buffer management for piecewise linear representation of multiple data streams (QX, JZ, MAS, XZ, CP), pp. 2114–2118.
CIKM-2012-ZhaoN #approach #modelling: A model-based approach for RFID data stream cleansing (ZZ, WN), pp. 862–871.
ICPR-2012-PanZF #correlation #query: Top-k correlated subgraph query for data streams (SP, XZ, MF), pp. 2906–2909.
KDIR-2012-AbdullinN #clustering #framework #learning: A Semi-supervised Learning Framework to Cluster Mixed Data Types (AA, ON), pp. 45–54.
KDIR-2012-FontanLAP #automation #web: Automatically Extracting Complex Data Structures from the Web (LF, RLG, MÁ, AP), pp. 246–251.
MLDM-2012-IsakssonDH #clustering #named: SOStream: Self Organizing Density-Based Clustering over Data Stream (CI, MHD, MH), pp. 264–278.
MLDM-2012-TaTB #approach #clustering #using: Clustering Data Stream by a Sub-window Approach Using DCA (MTT, LTHA, LBA), pp. 279–292.
ECOOP-2012-XuYR #detection #invariant #static analysis: Static Detection of Loop-Invariant Data Structures (G(X, DY, AR), pp. 738–763.
OOPSLA-2012-Xu #reuse: Finding reusable data structures (G(X), pp. 1017–1034.
POPL-2012-CaveP #programming: Programming with binders and indexed data-types (AC, BP), pp. 413–424.
SAC-2012-FariaBGC #algorithm #clustering: Improving the offline clustering stage of data stream algorithms in scenarios with variable number of clusters (ERF, RCB, JG, ACPLFC), pp. 829–830.
SAC-2012-FischerMK #realtime #visual notation: Real-time visual analytics for event data streams (FF, FM, DAK), pp. 801–806.
SAC-2012-NunesARTCS #analysis: To be or not to be real: fractal analysis of data streams from a regional climate change model (SAN, AMHdÁ, LASR, AJMT, PPC, EPMdS), pp. 831–832.
SAC-2012-PetitLR #query: Revisiting formal ordering in data stream querying (LP, CL, CR), pp. 813–818.
SAC-2012-YanZM #fuzzy #logic: f-SROIQ(G): an expressive fuzzy Description Logic supporting fuzzy data type group (LY, FZ, ZMM), pp. 320–325.
DAC-2012-Gester0NPSV #algorithm #performance: Algorithms and data structures for fast and good VLSI routing (MG, DM, TN, CP, CS, JV), pp. 459–464.
PPoPP-2012-KjolstadHS #automation #generative #optimisation: Automatic datatype generation and optimization (FK, TH, MS), pp. 327–328.
PPoPP-2012-KoganP #performance: A methodology for creating fast wait-free data structures (AK, EP), pp. 141–150.
TACAS-2012-DudkaMPV #contest #linked data #named #open data #source code #verification: Predator: A Verification Tool for Programs with Dynamic Linked Data Structures — (Competition Contribution) (KD, PM, PP, TV), pp. 545–548.
TACAS-2012-SonnexDE #automation #named #proving #recursion: Zeno: An Automated Prover for Properties of Recursive Data Structures (WS, SD, SE), pp. 407–421.
TACAS-2012-ZaeemGKM #satisfiability #using: History-Aware Data Structure Repair Using SAT (RNZ, DG, SK, KSM), pp. 2–17.
ICST-2012-McMinnSS #generative #query #search-based #string #using #web: Search-Based Test Input Generation for String Data Types Using the Results of Web Queries (PM, MS, MS), pp. 141–150.
LICS-2012-TraytelPB #category theory #composition #higher-order #logic #proving #theorem proving: Foundational, Compositional (Co)datatypes for Higher-Order Logic: Category Theory Applied to Theorem Proving (DT, AP, JCB), pp. 596–605.
TAP-2012-SenniF #constraints #generative #logic programming #testing #using: Generation of Test Data Structures Using Constraint Logic Programming (VS, FF), pp. 115–131.
PODS-2011-Muthukrishnan: Theory of data stream computing: where to go (SM), pp. 317–319.
SIGMOD-2011-SchaikM #memory management #performance #reachability: A memory efficient reachability data structure through bit vector compression (SJvS, OdM), pp. 913–924.
DLT-J-2010-RahulGR11 #category theory: Data Structures for Range-Aggregation over Categories (SR, PG, KSR), pp. 1707–1728.
ICFP-2011-AhnS #combinator #induction #recursion: A hierarchy of mendler style recursion combinators: taming inductive datatypes with negative occurrences (KYA, TS), pp. 234–246.
ICEIS-J-2011-ChaoC11a #clustering #resource management #ubiquitous: Ubiquitous Resource-Aware Clustering of Data Streams (CMC, GLC), pp. 81–97.
ICEIS-v1-2011-ChaoC #clustering #quality #resource management #ubiquitous: Resource-aware High Quality Clustering in Ubiquitous Data Streams (CMC, GLC), pp. 64–73.
CIKM-2011-GuoZTG #mining #multi: Mining frequent patterns across multiple data streams (JG, PZ, JT, LG), pp. 2325–2328.
CIKM-2011-KrishnaswamyGG #mining #mobile #roadmap #ubiquitous: Advances in data stream mining for mobile and ubiquitous environments (SK, JG, MMG), pp. 2607–2608.
CIKM-2011-LiZTLG #in the cloud #query: Continuous data stream query in the cloud (JL, PZ, JT, PL, LG), pp. 2389–2392.
CIKM-2011-ParkL #detection #evaluation #query: A continuous query evaluation scheme for a detection-only query over data streams (HKP, WSL), pp. 2405–2408.
CIKM-2011-WattanakitrungrojL #clustering #streaming: Memory-less unsupervised clustering for data streaming by versatile ellipsoidal function (NW, CL), pp. 967–972.
KDD-2011-BifetHPG #evolution #graph #mining: Mining frequent closed graphs on evolving data streams (AB, GH, BP, RG), pp. 591–599.
KDD-2011-ChuZLTT #learning #online: Unbiased online active learning in data streams (WC, MZ, LL, AT, BLT), pp. 195–203.
KDD-2011-JiangFH #graph #locality #network: Anomaly localization for network data streams with graph joint sparse PCA (RJ, HF, JH), pp. 886–894.
KDD-2011-KremerKJSBHP #clustering #effectiveness #evaluation #evolution: An effective evaluation measure for clustering on evolving data streams (HK, PK, TJ, TS, AB, GH, BP), pp. 868–876.
KDD-2011-LiuZCYX #interactive: Discovering spatio-temporal causal interactions in traffic data streams (WL, YZ, SC, JY, XX), pp. 1010–1018.
KDD-2011-ZhangLWGZG #modelling #performance #predict: Enabling fast prediction for ensemble models on data streams (PZ, JL, PW, BJG, XZ, LG), pp. 177–185.
KEOD-2011-BaumgartnerGMRS #reasoning: Reasoning on Data Streams for Situation Awareness (NB, WG, SM, WR, WS), pp. 407–412.
PLDI-2011-JungRRCP #effectiveness #named: Brainy: effective selection of data structures (CJ, SR, BPR, NC, SP), pp. 86–97.
PLDI-2011-KimR #commutative #linked data #open data #semantics #verification: Verification of semantic commutativity conditions and inverse operations on linked data structures (DK, MCR), pp. 528–541.
PLDI-2011-SampsonDFGCG #approximate #named #power management: EnerJ: approximate data types for safe and general low-power computation (AS, WD, EF, DG, LC, DG), pp. 164–174.
PLDI-2011-ZengWL #concurrent #monitoring #named #using: Cruiser: concurrent heap buffer overflow monitoring using lock-free data structures (QZ, DW, PL), pp. 367–377.
POPL-2011-OngR #algebra #functional #higher-order #pattern matching #source code #verification: Verifying higher-order functional programs with pattern-matching algebraic data types (CHLO, SJR), pp. 587–598.
ESEC-FSE-2011-SinghS: Synthesizing data structure manipulations from storyboards (RS, ASL), pp. 289–299.
ICSE-2011-XiaoZZ #analysis: Tracking data structures for postmortem analysis (XX, JZ, CZ), pp. 896–899.
SAC-2011-GomesRS #concept #learning: Learning recurring concepts from data streams with a context-aware ensemble (JBG, EMR, PACS), pp. 994–999.
SAC-2011-IkonomovskaGD #incremental #multi: Incremental multi-target model trees for data streams (EI, JG, SD), pp. 988–993.
SAC-2011-LeungJ #mining #nondeterminism #using: Frequent itemset mining of uncertain data streams using the damped window model (CKSL, FJ), pp. 950–955.
DATE-2011-KernST #automation #concept #embedded #migration: An automated data structure migration concept — From CAN to Ethernet/IP in automotive embedded systems (CANoverIP) (AK, TS, JT), pp. 112–117.
HPCA-2011-HouZHWFGC #challenge #performance #streaming: Efficient data streaming with on-chip accelerators: Opportunities and challenges (RH, LZ, MCH, KW, HF, YG, XC), pp. 312–320.
PDP-2011-LukawskiS #distributed #maintenance #scalability: Balancing Workloads of Servers Maintaining Scalable Distributed Data Structures (GL, KS), pp. 80–84.
PPoPP-2011-MurarasuWBBP #algorithm #grid #scalability: Compact data structure and scalable algorithms for the sparse grid technique (AFM, JW, GB, DB, DP), pp. 25–34.
STOC-2011-KaneNPW #estimation #performance: Fast moment estimation in data streams in optimal space (DMK, JN, EP, DPW), pp. 745–754.
CADE-2011-BohmeM #automation #challenge #proving: Heaps and Data Structures: A Challenge for Automated Provers (SB, MM), pp. 177–191.
CADE-2011-WiesMK #imperative #performance: An Efficient Decision Procedure for Imperative Tree Data Structures (TW, MM, VK), pp. 476–491.
CAV-2011-DudkaPV #logic #named #using: Predator: A Practical Tool for Checking Manipulation of Dynamic Data Structures Using Separation Logic (KD, PP, TV), pp. 372–378.
CAV-2011-HagueL #model checking #recursion #source code: Model Checking Recursive Programs with Numeric Data Types (MH, AWL), pp. 743–759.
CAV-2011-LeeYP #program analysis: Program Analysis for Overlaid Data Structures (OL, HY, RP), pp. 592–608.
ICST-2011-HeamN #generative #named #random #recursion #testing: Seed: An Easy-to-Use Random Generator of Recursive Data Structures for Testing (PCH, CN), pp. 60–69.
ICST-2011-MalikSK #constraints #debugging #using: Constraint-Based Program Debugging Using Data Structure Repair (MZM, JHS, SK), pp. 190–199.
TAP-2011-SoekenWD #encoding #modelling #ocl #satisfiability #uml #verification: Encoding OCL Data Types for SAT-Based Verification of UML/OCL Models (MS, RW, RD), pp. 152–170.
DocEng-2010-ThaoM #detection #using #version control #xml: Using versioned tree data structure, change detection and node identity for three-way XML merging (CT, EVM), pp. 77–86.
ECDL-2010-Black #framework #metadata #pattern matching #using: Using Pattern Language as a Framework for Future Metadata Structure (EAB), pp. 393–396.
PODS-2010-NelsonW #performance #sketching: Fast Manhattan sketches in data streams (JN, DPW), pp. 99–110.
SIGMOD-2010-TranPLDL #algorithm #named #nondeterminism: PODS: a new model and processing algorithms for uncertain data streams (TTLT, LP, BL, YD, AL), pp. 159–170.
SIGMOD-2010-VaidyaLBDNX #configuration management #logic #named: Symbiote: a reconfigurable logic assisted data streammanagement system (RLADSMS) (PV, JJL, FB, YD, CHN, YX), pp. 1147–1150.
SIGMOD-2010-YangGXRW #interactive #visual notation: Interactive visual exploration of neighbor-based patterns in data streams (DY, ZG, ZX, EAR, MOW), pp. 1151–1154.
VLDB-2010-TranMDPL #nondeterminism: Conditioning and Aggregating Uncertain Data Streams: Going Beyond Expectations (TTLT, AM, YD, LP, AL), pp. 1302–1313.
ICALP-v1-2010-Duan: New Data Structures for Subgraph Connectivity (RD), pp. 201–212.
ICALP-v1-2010-RudraU #algorithm #testing: Data Stream Algorithms for Codeword Testing (AR, SU), pp. 629–640.
RTA-2010-ZantemaR #infinity #proving: Proving Productivity in Infinite Data Structures (HZ, MR), pp. 401–416.
ICEIS-DISI-2010-PreisslerHL #streaming: Process-based Data Streaming in Service-oriented Environments — Application and Technique (SP, DH, WL), pp. 40–49.
CIKM-2010-ShinPWL #execution #named #online: i-SEE: integrated stream execution environment over on-line data streams (SJS, HKP, HJW, WSL), pp. 1959–1960.
CIKM-2010-ZhangZTG #concept #framework #named: SKIF: a data imputation framework for concept drifting data streams (PZ, XZ, JT, LG), pp. 1869–1872.
ICML-2010-GomesK #learning #parametricity: Budgeted Nonparametric Learning from Data Streams (RG, AK), pp. 391–398.
KDD-2010-LamC #flexibility #mining: Mining top-k frequent items in a data stream with flexible sliding windows (HTL, TC), pp. 283–292.
ECOOP-2010-ZaeemK #alloy #contract #using: Contract-Based Data Structure Repair Using Alloy (RNZ, SK), pp. 577–598.
PLDI-2010-AcarBLTT #self: Traceable data types for self-adjusting computation (UAA, GEB, RLW, KT, DT), pp. 483–496.
PLDI-2010-TianFG #parallel: Supporting speculative parallelization in the presence of dynamic data structures (CT, MF, RG), pp. 62–73.
PLDI-2010-XuMARSS: Finding low-utility data structures (G(X, NM, MA, AR, ES, GS), pp. 174–186.
POPL-2010-DreyerNRB #higher-order #logic #relational: A relational modal logic for higher-order stateful ADTs (DD, GN, AR, LB), pp. 185–198.
POPL-2010-SuterDK #abstraction #algebra: Decision procedures for algebraic data types with abstractions (PS, MD, VK), pp. 199–210.
SAS-2010-CheriniRB #analysis: A Shape Analysis for Non-linear Data Structures (RC, LR, JOB), pp. 201–217.
ASE-2010-Balint #automation #behaviour: Automatic inference of abstract type behavior (MB), pp. 499–504.
ICSE-2010-HussainC: Dynamic symbolic data structure repair (IH, CC), pp. 215–218.
SAC-2010-GaberS #classification #distributed #network: Distributed data stream classification for wireless sensor networks (MMG, AMS), pp. 1629–1630.
SAC-2010-RibeiroS #named #network #performance: g-tries: an efficient data structure for discovering network motifs (PMPR, FMAS), pp. 1559–1566.
SAC-2010-ShieTY #mining #online: Online mining of temporal maximal utility itemsets from data streams (BES, VST, PSY), pp. 1622–1626.
SAC-2010-TeixeiraM #detection: Data stream anomaly detection through principal subspace tracking (PHdST, RLM), pp. 1609–1616.
HPDC-2010-LiewAHH #distributed #graph #optimisation #parallel #streaming #towards #using: Towards optimising distributed data streaming graphs using parallel streams (CSL, MPA, JIvH, LH), pp. 725–736.
HPDC-2010-PerryS #communication: Improving MPI communication via data type fission (BP, DMS), pp. 352–355.
PPoPP-2010-UpadhyayaMP #generative #performance #using: Using data structure knowledge for efficient lock generation and strong atomicity (GU, SPM, VSP), pp. 281–292.
CAV-2010-ConwayB #implementation #low level #verification: Verifying Low-Level Implementations of High-Level Datatypes (CLC, CB), pp. 306–320.
CSL-2010-KuncakPS #calculus #order #set: Ordered Sets in the Calculus of Data Structures (VK, RP, PS), pp. 34–48.
IJCAR-2010-MagkaKH #logic: Tractable Extensions of the Description Logic EL with Numerical Datatypes (DM, YK, IH), pp. 61–75.
TAP-2010-Blanchette #algebra #analysis #induction #recursion #relational: Relational Analysis of (Co)inductive Predicates, (Co)algebraic Datatypes, and (Co)recursive Functions (JCB), pp. 117–134.
VMCAI-2010-KuncakPSW #calculus: Building a Calculus of Data Structures (VK, RP, PS, TW), pp. 26–44.
ECDL-2009-FerroS #framework #how: The NESTOR Framework: How to Handle Hierarchical Data Structures (NF, GS), pp. 215–226.
SIGMOD-2009-NehmeLBR #approach #named #privacy #security #towards: StreamShield: a stream-centric approach towards security and privacy in data stream environments (RVN, HSL, EB, EAR), pp. 1027–1030.
SIGMOD-2009-YalamanchiG: Compensation-aware data types in RDBMS (AY, DG), pp. 931–938.
VLDB-2009-DasAAA #architecture #concurrent #manycore #thread: Thread Cooperation in Multicore Architectures for Frequency Counting over Multiple Data Streams (SD, SA, DA, AEA), pp. 217–228.
ITiCSE-2009-ErnstSW #evolution #hybrid: Hybrid and custom data structures: evolution of the data structures course (DJE, DES, PJW), pp. 213–217.
ITiCSE-2009-Garcia-MateosA #algorithm #online #using: A course on algorithms and data structures using on-line judging (GGM, JLFA), pp. 45–49.
ICALP-v1-2009-ChakrabartiCM: Annotations in Data Streams (AC, GC, AM), pp. 222–234.
ICFP-2009-SchrijversJSV #decidability #type inference: Complete and decidable type inference for GADTs (TS, SLPJ, MS, DV), pp. 341–352.
ICFP-2009-YakushevHLJ #fixpoint #programming #recursion: Generic programming with fixed points for mutually recursive datatypes (ARY, SH, AL, JJ), pp. 233–244.
ICEIS-ISAS-2009-HidalgoGT #consistency #detection #nondeterminism #performance: Efficient Data Structures for Local Inconsistency Detection in Firewall ACL Updates (SPH, RMG, FTdlR), pp. 176–181.
CIKM-2009-GedikAW #approach #code generation #distributed #optimisation: A code generation approach to optimizing high-performance distributed data stream processing (BG, HA, KLW), pp. 847–856.
CIKM-2009-GuYGC #probability #query: Probabilistic moving range query over RFID spatio-temporal data streams (YG, GY, NG, YC), pp. 1413–1416.
CIKM-2009-HaghaniMA #query #semistructured data: Evaluating top-k queries over incomplete data streams (PH, SM, KA), pp. 877–886.
CIKM-2009-HeZSC #clustering #multi #query #rank: Cluster based rank query over multidimensional data streams (DH, YZ, LS, GC), pp. 1493–1496.
CIKM-2009-LianC #nondeterminism #performance: Efficient join processing on uncertain data streams (XL, LC), pp. 857–866.
CIKM-2009-TaoO #mining: Mining data streams with periodically changing distributions (YT, MTÖ), pp. 887–896.
CIKM-2009-TaoO09a #mining: Mining frequent itemsets in time-varying data streams (YT, MTÖ), pp. 1521–1524.
CIKM-2009-WooSYL #named: DS-Cuber: an integrated OLAP environment for data streams (HJW, SJS, WSY, WSL), pp. 2067–2068.
KDD-2009-BifetHPKG #evolution: New ensemble methods for evolving data streams (AB, GH, BP, RK, RG), pp. 139–148.
MLDM-2009-CeciALCFVM #detection #mining #relational: Relational Frequent Patterns Mining for Novelty Detection from Data Streams (MC, AA, CL, CC, FF, CV, DM), pp. 427–439.
SEKE-2009-ChaoS #clustering #privacy: Privacy-preserving Clustering of Data Streams (CMC, CCS), pp. 530–535.
PLDI-2009-AndersonGN #concurrent #lightweight: Lightweight annotations for controlling sharing in concurrent data structures (ZRA, DG, MN), pp. 98–109.
PLDI-2009-KawaguchiRJ #type system #verification: Type-based data structure verification (MK, PMR, RJ), pp. 304–315.
POPL-2009-MontaguR #modelling: Modeling abstract types in modules with open existential types (BM, DR), pp. 354–365.
ASE-2009-MalikGEK #automation #debugging #using: A Case for Automated Debugging Using Data Structure Repair (MZM, KG, BE, SK), pp. 620–624.
SAC-2009-ChaovalitG #clustering: A method for clustering transient data streams (PC, AG), pp. 1518–1519.
SAC-2009-GamaRS #algorithm: Evaluating algorithms that learn from data streams (JG, PPR, RS), pp. 1496–1500.
SAC-2009-KahvedzicK #on the #persistent: On the persistence of deleted windows registry data structures (DK, MTK), pp. 895–896.
SAC-2009-LuYLELW #correlation #detection #incremental #using: Incremental outlier detection in data streams using local correlation integral (XL, TY, ZL, ME, WL, HW), pp. 1520–1521.
SAC-2009-MarascuM #detection: Parameterless outlier detection in data streams (AM, FM), pp. 1491–1495.
SAC-2009-RossTA #online #predict: Online annotation and prediction for regime switching data streams (GJR, DKT, NMA), pp. 1501–1505.
SAC-2009-Tarau #finite #haskell #morphism: Isomorphisms, hylomorphisms and hereditarily finite data types in Haskell (PT), pp. 1898–1902.
SLE-2009-IrazabalP #model transformation #modelling #transformation language: Model Transformation Languages Relying on Models as ADTs (JI, CP), pp. 133–143.
HPCA-2009-EbrahimiMP #hybrid #linked data #open data: Techniques for bandwidth-efficient prefetching of linked data structures in hybrid prefetching systems (EE, OM, YNP), pp. 7–17.
ESOP-2009-Campbell #analysis #memory management #using: Amortised Memory Analysis Using the Depth of Data Structures (BC), pp. 190–204.
STOC-2009-Viola #bound: Bit-probe lower bounds for succinct data structures (EV), pp. 475–482.
ECSA-2008-HanselOS #named: L-DSMS — A Local Data Stream Management System (CH, HJO, EPS), pp. 298–305.
WICSA-2008-GortonWAC #framework #integration #performance #platform #streaming: The MeDICi Integration Framework: A Platform for High Performance Data Streaming Applications (IG, AW, JA, JC), pp. 95–104.
SIGMOD-2008-JohnsonMSS #clustering #monitoring #network: Query-aware partitioning for monitoring massive network data streams (TJ, SMM, VS, OS), pp. 1135–1146.
SIGMOD-2008-LiuPRY #algorithm #evaluation: Near-optimal algorithms for shared filter evaluation in data stream systems (ZL, SP, AR, HY), pp. 133–146.
SIGMOD-2008-MajumderRV #regular expression #scalability: Scalable regular expression matching on data streams (AM, RR, SV), pp. 161–172.
VLDB-2008-CormodeH: Finding frequent items in data streams (GC, MH), pp. 1530–1541.
VLDB-2008-KunduB: Structural signatures for tree data structures (AK, EB), pp. 138–150.
VLDB-2008-SharafLC #query #scheduling: Scheduling continuous queries in data stream management systems (MAS, AL, PKC), pp. 1526–1527.
ITiCSE-2008-MatzkoD #approach: A graphics-based approach to data structures (SM, TAD), pp. 109–113.
ITiCSE-2008-ThorntonE #data flow #online: A data type to exploit online data sources (MT, SHE), pp. 114–118.
ICALP-A-2008-DietzfelbingerP #approximate #retrieval: Succinct Data Structures for Retrieval and Approximate Membership (MD, RP), pp. 385–396.
RTA-2008-FalkeK #dependence #semantics: Dependency Pairs for Rewriting with Built-In Numbers and Semantic Data Structures (SF, DK), pp. 94–109.
Haskell-2008-AhnS #algebra #recursion #type system: Shared subtypes: subtyping recursive parametrized algebraic data types (KYA, TS), pp. 75–86.
ICFP-2008-Krauss #problem #recursion: Pattern minimization problems over recursive data types (AK), pp. 267–274.
IFL-2008-LijnseP #automation #database #programming #relational #using: Between Types and Tables — Using Generic Programming for Automated Mapping between Data Types and Relational Databases (BL, RP), pp. 272–290.
ICGT-2008-RiegerN: Abstracting Complex Data Structures by Hyperedge Replacement (SR, TN), pp. 69–83.
CIKM-2008-BoedihardjoLC #framework #probability: A framework for estimating complex probability density structures in data streams (APB, CTL, FC), pp. 619–628.
CIKM-2008-LeeL #clustering #multi #online: A coarse-grain grid-based subspace clustering method for online multi-dimensional data streams (JWL, WSL), pp. 1521–1522.
CIKM-2008-TanbeerAJL #mining #performance: Efficient frequent pattern mining over data streams (SKT, CFA, BSJ, YKL), pp. 1447–1448.
KDD-2008-BifetG #adaptation #mining: Mining adaptively frequent closed unlabeled rooted trees in data streams (AB, RG), pp. 34–42.
KDD-2008-ZhangZS #categorisation #concept #mining: Categorizing and mining concept drifting data streams (PZ, XZ, YS), pp. 812–820.
SEKE-2008-Chao #classification #privacy: Privacy-preserving Classification of Data Streams (CMC), pp. 603–606.
PLDI-2008-Solar-LezamaJB #concurrent #sketching: Sketching concurrent data structures (ASL, CGJ, RB), pp. 136–148.
PLDI-2008-ZeeKR #functional #linked data #open data #verification: Full functional verification of linked data structures (KZ, VK, MCR), pp. 349–361.
POPL-2008-Danielsson #analysis #complexity #functional #lightweight: Lightweight semiformal time complexity analysis for purely functional data structures (NAD), pp. 133–144.
POPL-2008-JohannG #programming: Foundations for structured programming with GADTs (PJ, NG), pp. 297–308.
POPL-2008-McBride: Clowns to the left of me, jokers to the right (pearl): dissecting data structures (CM), pp. 287–295.
ICSE-2008-ElkarabliehK #named: Juzi: a tool for repairing complex data structures (BE, SK), pp. 855–858.
SAC-2008-AnagnostopoulosAH #adaptation #multi #what: Deciding what to observe next: adaptive variable selection for regression in multivariate data streams (CA, NMA, DJH), pp. 961–965.
SAC-2008-KontakiPM #multi: Continuous k-dominant skyline computation on multidimensional data streams (MK, ANP, YM), pp. 956–960.
SAC-2008-MontanaTT #algorithm #mining: Data stream mining for market-neutral algorithmic trading (GM, KT, TT), pp. 966–970.
SAC-2008-SpinosaCG #clustering #concept #detection #network #novel: Cluster-based novel concept detection in data streams applied to intrusion detection in computer networks (EJS, ACPLFdC, JG), pp. 976–980.
OSDI-2008-CozzieSXK: Digging for Data Structures (AC, FS, HX, STK), pp. 255–266.
PPoPP-2008-ChandraSSB #analysis #distributed #locality #type inference: Type inference for locality analysis of distributed data structures (SC, VAS, VS, RB), pp. 11–22.
ESOP-2008-ConchonF: Semi-persistent Data Structures (SC, JCF), pp. 322–336.
ISSTA-2008-KannanS #execution #generative #invariant #symbolic computation: Universal symbolic execution and its application to likely data structure invariant generation (YK, KS), pp. 283–294.
TAP-2008-DunetsSR #analysis #bound #relational: Bounded Relational Analysis of Free Data Types (AD, GS, WR), pp. 99–115.
PODS-2007-CohenDKLT #query #sketching: Sketching unaggregated data streams for subpopulation-size queries (EC, NGD, HK, CL, MT), pp. 253–262.
PODS-2007-JayramMMV #probability #statistics: Estimating statistical aggregates on probabilistic data streams (TSJ, AM, SM, EV), pp. 243–252.
SIGMOD-2007-BandiMAA #algorithm #performance #using: Fast data stream algorithms using associative memories (NB, AM, DA, AEA), pp. 247–256.
SIGMOD-2007-BrettleckerS #framework #mobile #reliability: The OSIRIS-SE (stream-enabled) infrastructure for reliable data stream management on mobile devices (GB, HS), pp. 1097–1099.
SIGMOD-2007-CormodeG #probability #sketching: Sketching probabilistic data streams (GC, MNG), pp. 281–292.
SIGMOD-2007-CormodeG07a #distributed #query #streaming: Streaming in a connected world: querying and tracking distributed data streams (GC, MNG), pp. 1178–1181.
SIGMOD-2007-DullerTAK #named: XTream: personal data streams (MD, RT, GA, DK), pp. 1088–1090.
SIGMOD-2007-Lefler: Data streams go mainstream (RML), pp. 971–972.
SIGMOD-2007-MarkowetzYP #keyword #relational: Keyword search on relational data streams (AM, YY, DP), pp. 605–616.
VLDB-2007-DasGKS #ad hoc #query: Ad-hoc Top-k Query Answering for Data Streams (GD, DG, NK, NS), pp. 183–194.
VLDB-2007-PapadopoulosYP #authentication #named: CADS: Continuous Authentication on Data Streams (SP, YY, DP), pp. 135–146.
ITiCSE-2007-CalderCLLS #education #student: Teaching data structures to students who are blind (MC, RFC, JAL, NL, JS), pp. 87–90.
ITiCSE-2007-ChinnSM #algorithm #performance #problem #student: Problem solving and student performance in data structures and algorithms (DDC, CS, KM), pp. 241–245.
ITiCSE-2007-ErkanVS #tex #visualisation: Data structure visualization with latex and prefuse (ASE, TJV, TMS), pp. 301–305.
ICALP-2007-GuptaHSV #framework: A Framework for Dynamizing Succinct Data Structures (AG, WKH, RS, JSV), pp. 521–532.
IFM-2007-FaberJS #parametricity #specification #verification: Verifying CSP-OZ-DC Specifications with Complex Data Types and Timing Parameters (JF, SJ, VSS), pp. 233–252.
IFM-2007-Toben #communication #reduction: Non-interference Properties for Data-Type Reduction of Communicating Systems (TT), pp. 619–638.
ICFP-2007-FilinskiS #induction #reasoning: Inductive reasoning about effectful data types (AF, KS), pp. 97–110.
IFL-2007-FindlerGR #contract #lazy evaluation: Lazy Contract Checking for Immutable Data Structures (RBF, SyG, AR), pp. 111–128.
ILC-2007-WozniakDW #abstraction #policy: Dynamic ADTs: a “don’t ask, don’t tell” policy for data abstraction (GW, MD, SW), p. 26.
CIKM-2007-ParkL #clustering: Grid-based subspace clustering over data streams (NHP, WSL), pp. 801–810.
CIKM-2007-ShinL #interactive #online: An on-line interactive method for finding association rules data streams (SJS, WSL), pp. 963–966.
CIKM-2007-ZhangW #algorithm #approximate #performance: An efficient algorithm for approximate biased quantile computation in data streams (QZ, WW), pp. 1023–1026.
KDD-2007-Aggarwal #classification #framework #segmentation: A framework for classification and segmentation of massive audio data streams (CCA), pp. 1013–1017.
KDD-2007-AggarwalY #classification #on the #string: On string classification in data streams (CCA, PSY), pp. 36–45.
MLDM-2007-AoYHH #mining: Mining Maximal Frequent Itemsets in Data Streams Based on FP-Tree (FA, YY, JH, KH), pp. 479–489.
MLDM-2007-FullerK #distributed #monitoring #named: FIDS: Monitoring Frequent Items over Distributed Data Streams (RF, MMK), pp. 464–478.
MLDM-2007-WangLYC #classification #fuzzy #incremental #mining: An Incremental Fuzzy Decision Tree Classification Method for Mining Data Streams (TW, ZL, YY, HC), pp. 91–103.
PLDI-2007-BurckhardtAM #concurrent #consistency #memory management #modelling #named: CheckFence: checking consistency of concurrent data types on relaxed memory models (SB, RA, MMKM), pp. 12–21.
PLDI-2007-ShankarB #automation #invariant #java #named: DITTO: automatic incrementalization of data structure invariant checks (in Java) (AS, RB), pp. 310–319.
PPDP-2007-Hamana #higher-order #induction #semantics #type system: Higher-order semantic labelling for inductive datatype systems (MH), pp. 97–108.
ASE-2007-ElkarabliehGSK: Assertion-based repair of complex data structures (BE, IG, YLS, SK), pp. 64–73.
SAC-2007-SpinosaCG #approach #clustering #concept #detection #named: OLINDDA: a cluster-based approach for detecting novelty and concept drift in data streams (EJS, ACPdLFdC, JG), pp. 448–452.
PDP-2007-BinzenhoferHKE #network #performance #scalability #simulation: Efficient Simulation of Large-Scale P2P Networks: Compact Data Structures (AB, TH, GK, KE), pp. 467–474.
PDP-2007-CampanileCCR #adaptation #parsing #realtime: Adaptable Parsing of Real-Time Data Streams (FC, AC, LC, LR), pp. 412–418.
ESOP-2007-BlanquiHW #implementation #on the: On the Implementation of Construction Functions for Non-free Concrete Data Types (FB, TH, PW), pp. 95–109.
ESOP-2007-NanevskiAMB #hoare #type system: Abstract Predicates and Mutable ADTs in Hoare Type Theory (AN, AA, GM, LB), pp. 189–204.
SMT-J-2006-BarrettST #formal method #induction: An Abstract Decision Procedure for a Theory of Inductive Data Types (CB, IS, CT), pp. 21–46.
CAV-2007-BerdineCCDOWY #analysis: Shape Analysis for Composite Data Structures (JB, CC, BC, DD, PWO, TW, HY), pp. 178–192.
VMCAI-2007-BouillaguetKWZR #first-order #proving #theorem proving #using #verification: Using First-Order Theorem Provers in the Jahob Data Structure Verification System (CB, VK, TW, KZ, MCR), pp. 74–88.
VMCAI-2007-RakamaricBH #source code #verification: An Inference-Rule-Based Decision Procedure for Verification of Heap-Manipulating Programs with Mutable Data and Cyclic Data Structures (ZR, JDB, AJH), pp. 106–121.
PODS-2006-BuriolFLMS: Counting triangles in data streams (LSB, GF, SL, AMS, CS), pp. 253–262.
PODS-2006-CormodeKMS #algorithm: Space- and time-efficient deterministic algorithms for biased quantiles over data streams (GC, FK, SM, DS), pp. 263–272.
SIGMOD-2006-KornMW #modelling: Modeling skew in data streams (FK, SM, YW), pp. 181–192.
SIGMOD-2006-LimLLWS #query #using: Continuous query processing in data streams using duality of data and queries (HSL, JGL, MJL, KYW, IYS), pp. 313–324.
SIGMOD-2006-SharfmanSK #approach #distributed #geometry #monitoring: A geometric approach to monitoring threshold functions over distributed data streams (IS, AS, DK), pp. 301–312.
VLDB-2006-JefferyGF #adaptation: Adaptive Cleaning for RFID Data Streams (SRJ, MNG, MJF), pp. 163–174.
VLDB-2006-LiCTACH #query #safety: Safety Guarantee of Continuous Join Queries over Punctuated Data Streams (HGL, SC, JT, DA, KSC, WPH), pp. 19–30.
VLDB-2006-TatbulZ #query: Window-Aware Load Shedding for Aggregation Queries over Data Streams (NT, SBZ), pp. 799–810.
ITiCSE-2006-Sher #internet: Motivating data structures with caching internet stock data (DBS), p. 344.
ICPC-2006-PhengV #analysis #java #source code: Dynamic Data Structure Analysis for Java Programs (SP, CV), pp. 191–201.
FLOPS-2006-DiscoloHMJS #haskell #using: Lock Free Data Structures Using STM in Haskell (AD, TH, SM, SLPJ, SS), pp. 65–80.
FLOPS-2006-SulzmannWS #algebra #framework: A Framework for Extended Algebraic Data Types (MS, JW, PJS), pp. 47–64.
Haskell-2006-DiatchkiJ #functional #memory management #programming: Strongly typed memory areas programming systems-level data structures in a functional language (ISD, MPJ), pp. 72–83.
ICFP-2006-JonesVWW #type inference: Simple unification-based type inference for GADTs (SLPJ, DV, SW, GW), pp. 50–61.
CIG-2006-Cazenave #algorithm #heuristic #optimisation: Optimizations of data structures, heuristics and algorithms for path-finding on maps (TC), pp. 27–33.
ICEIS-DISI-2006-LongboZMYY #algorithm #random: Random Sampling Algorithms for Landmark Windows over Data Streams (LZ, ZL, YM, WY, JY), pp. 103–107.
CIKM-2006-BaiTWLZ: A data stream language and system designed for power and extensibility (YB, HT, HW, CL, CZ), pp. 337–346.
CIKM-2006-JainZC #adaptation #clustering: Adaptive non-linear clustering in data streams (AJ, ZZ, EYC), pp. 122–131.
CIKM-2006-KuntschkeK #evaluation: Matching and evaluation of disjunctive predicates for data stream sharing (RK, AK), pp. 832–833.
CIKM-2006-OjewoleZH #approximate #semantics: Window join approximation over data streams with importance semantics (AO, QZ, WCH), pp. 112–121.
CIKM-2006-XuWFSP #classification #correlation: Classification spanning correlated data streams (YX, KW, AWCF, RS, JP), pp. 132–141.
KDD-2006-JiangG #mining #named: CFI-Stream: mining closed frequent itemsets in data streams (NJ, LG), pp. 592–597.
KDD-2006-WangYPYY #concept #mining: Suppressing model overfitting in mining concept-drifting data streams (HW, JY, JP, PSY, JXY), pp. 736–741.
OOPSLA-2006-DargaB #model checking #performance: Efficient software model checking of data structure properties (PTD, CB), pp. 363–382.
PLDI-2006-ChilimbiS: Cache-conscious coallocation of hot data streams (TMC, RS), pp. 252–262.
POPL-2006-PottierR #algebra #type inference: Stratified type inference for generalized algebraic data types (FP, YRG), pp. 232–244.
PPDP-2006-LohH #open data: Open data types and open functions (AL, RH), pp. 133–144.
PPDP-2006-SchrijversB #algebra #polymorphism #re-engineering: Polymorphic algebraic data type reconstruction (TS, MB), pp. 85–96.
SAS-2006-BouajjaniHRV #model checking: Abstract Regular Tree Model Checking of Complex Dynamic Data Structures (AB, PH, AR, TV), pp. 52–70.
ASE-2006-PaarT #owl #programming language #xml: Programming Language Inherent Support for Constrained XML Schema Definition Data Types and OWL DL (AP, WFT), pp. 281–284.
FSE-2006-KapurMZ: Interpolation for data structures (DK, RM, CGZ), pp. 105–116.
SAC-2006-Ferrer-TroyanoAS #classification #incremental #learning: Data streams classification by incremental rule learning with parameterized generalization (FJFT, JSAR, JCRS), pp. 657–661.
SAC-2006-GaberY #approach #clustering #framework #information management #resource management: A framework for resource-aware knowledge discovery in data streams: a holistic approach with its application to clustering (MMG, PSY), pp. 649–656.
SAC-2006-GamaP #data mining #mining: Discretization from data streams: applications to histograms and data mining (JG, CP), pp. 662–667.
SAC-2006-SousaTTF #evolution: Evaluating the intrinsic dimension of evolving data streams (EPMdS, AJMT, CTJ, CF), pp. 643–648.
DATE-2006-BartzasMPACST #design #energy #network #refinement: Dynamic data type refinement methodology for systematic performance-energy design exploration of network applications (AB, SM, GP, DA, FC, DS, AT), pp. 740–745.
HPDC-2006-CaiKS #named #network #performance #predict: IQ-Paths: Predictably High Performance Data Streams across Dynamic Network Overlays (ZC, VK, KS), pp. 18–29.
ISMM-2006-AgaramKLM #memory management #performance: Decomposing memory performance: data structures and phases (KKA, SWK, CL, KSM), pp. 95–103.
TACAS-2006-DeshmukhEG #automation #verification: Automatic Verification of Parameterized Data Structures (JVD, EAE, PG), pp. 27–41.
CAV-2006-BurckhardtAM #bound #case study #concurrent #memory management #model checking #modelling: Bounded Model Checking of Concurrent Data Types on Relaxed Memory Models: A Case Study (SB, RA, MMKM), pp. 489–502.
IJCAR-2006-UrbanB #combinator #higher-order #recursion: A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL (CU, SB), pp. 498–512.
ISSTA-2006-DemskyEGMPR #consistency #specification: Inference and enforcement of data structure consistency specifications (BD, MDE, PJG, SM, JHP, MCR), pp. 233–244.
ISSTA-2006-GuoPME: Dynamic inference of abstract types (PJG, JHP, SM, MDE), pp. 255–265.
DocEng-2005-GruhlMP #case study #xml: A case study on alternate representations of data structures in XML (DG, DNM, JP), pp. 217–219.
ICDAR-2005-LamH #performance #using: A Data Structure Using Hashing and Tries For Efficient Chinese Lexical Access (YKL, QH), pp. 506–510.
PODS-2005-HershbergerSST #complexity #multi: Space complexity of hierarchical heavy hitters in multi-dimensional data streams (JH, NS, SS, CDT), pp. 338–347.
SIGMOD-2005-LiMTPT #evaluation #semantics: Semantics and Evaluation Techniques for Window Aggregates in Data Streams (JL, DM, KT, VP, PAT), pp. 311–322.
SIGMOD-2005-LuoTWZ #mining #sql: A native extension of SQL for mining data streams (CL, HT, HW, CZ), pp. 873–875.
SIGMOD-2005-SrivastavaKZO #multi: Multiple Aggregations Over Data Streams (RZ, NK, BCO, DS), pp. 299–310.
VLDB-2005-AliABEHKM #detection #framework #named: NILE-PDT: A Phenomenon Detection and Tracking Framework for Data Stream Management Systems (MHA, WGA, RB, AKE, AH, IK, MFM), pp. 1295–1298.
VLDB-2005-ChiWY #mining #named: Loadstar: Load Shedding in Data Stream Mining (YC, HW, PSY), pp. 1303–1305.
VLDB-2005-CormodeMR #mining: Summarizing and Mining Inverse Distributions on Data Streams via Dynamic Inverse Sampling (GC, SM, IR), pp. 25–36.
VLDB-2005-GuhaS #algorithm #performance: Offline and Data Stream Algorithms for Efficient Computation of Synopsis Structures (SG, KS), p. 1364.
VLDB-2005-HuSCS #using: Supporting RFID-based Item Tracking Applications in Oracle DBMS Using a Bitmap Datatype (YH, SS, TC, JS), pp. 1140–1151.
VLDB-2005-KuntschkeSKR #named: StreamGlobe: Processing and Sharing Data Streams in Grid-Based P2P Infrastructures (RK, BS, AK, AR), pp. 1259–1262.
ITiCSE-2005-MurphyT #student #what: Do computer science students know what they know?: a calibration study of data structure knowledge (LM, JDT), pp. 148–152.
ITiCSE-2005-PatersonHBM #ide #using: Using the BlueJ IDE in a data structures course (JHP, JH, MB, AM), p. 349.
SEFM-2005-LanotteMT #analysis #automaton #design #distributed: Timed Automata with Data Structures for Distributed Systems Design and Analysis (RL, AMS, AT), pp. 44–53.
ICFP-2005-Nilsson #algebra #functional #optimisation #programming #using: Dynamic optimization for functional reactive programming using generalized algebraic data types (HN), pp. 54–65.
CIKM-2005-LaurNSP #estimation #on the: On the estimation of frequent itemsets for data streams: theory and experiments (PAL, RN, JES, PP), pp. 327–328.
ICML-2005-Ho #concept #detection #framework: A martingale framework for concept change detection in time-varying data streams (SSH), pp. 321–327.
KDD-2005-GuhaH #fault: Wavelet synopsis for data streams: minimizing non-euclidean error (SG, BH), pp. 88–97.
KDD-2005-YangWZ #predict: Combining proactive and reactive predictions for data streams (YY, XW, XZ), pp. 710–715.
MLDM-2005-LaurSNP #statistics: Statistical Supports for Frequent Itemsets on Data Streams (PAL, JES, RN, PP), pp. 395–404.
OOPSLA-2005-KennedyR #algebra #object-oriented #programming: Generalized algebraic data types and object-oriented programming (AK, CVR), pp. 21–40.
PLDI-2005-LattnerA #automation #layout #performance: Automatic pool allocation: improving performance by controlling data structure layout in the heap (CL, VSA), pp. 129–142.
ESEC-FSE-2005-KuncakJ #algebra #analysis #relational: Relational analysis of algebraic datatypes (VK, DJ), pp. 207–216.
ICSE-2005-DemskyR #reasoning #using: Data structure repair using goal-directed reasoning (BD, MCR), pp. 176–185.
SAC-2005-BertholdSLH #resource management: Integrated resource management for data stream systems (HB, SS, WL, CJH), pp. 555–562.
SAC-2005-Ferrer-TroyanoAS #incremental #learning: Incremental rule learning based on example nearness from numerical data streams (FJFT, JSAR, JCRS), pp. 568–572.
SAC-2005-GamaMR #learning: Learning decision trees from dynamic data streams (JG, PM, PPR), pp. 573–577.
SAC-2005-HeinzS: Wavelet density estimators over data streams (CH, BS), pp. 578–579.
CC-2005-LamKR #consistency #named #verification: Hob: A Tool for Verifying Data Structure Consistency (PL, VK, MCR), pp. 237–241.
DATE-2005-StuijkBMG #multi #predict #scalability: Predictable Embedding of Large Data Structures in Multiprocessor Networks-on-Chip (SS, TB, BM, MG), pp. 254–255.
HPDC-2005-VijayakumarLP #data access #grid #named: Calder: enabling grid access to data streams (NNV, YL, BP), pp. 283–284.
PDP-2005-GuiradoRRL #parallel #trade-off: Exploitation of Parallelism for Applications with an Input Data Stream: Optimal Resource-Throughput Tradeoffs (FG, AR, CR, EL), pp. 170–178.
STOC-2005-FrahlingS #geometry: Coresets in dynamic geometric data streams (GF, CS), pp. 209–217.
STOC-2005-IndykW #approximate: Optimal approximations of the frequency moments of data streams (PI, DPW), pp. 202–208.
CADE-2005-Lev-AmiIRSSY #first-order #linked data #logic #open data #reachability #simulation #using #verification: Simulating Reachability Using First-Order Logic with Applications to Verification of Linked Data Structures (TLA, NI, TWR, SS, SS, GY), pp. 99–115.
CAV-2005-McPeakN #axiom #similarity #specification: Data Structure Specifications via Local Equality Axioms (SM, GCN), pp. 476–490.
ICLP-2005-SahaR #evaluation #graph #incremental #performance: Symbolic Support Graph: A Space Efficient Data Structure for Incremental Tabled Evaluation (DS, CRR), pp. 235–249.
VMCAI-2005-LamKR #consistency #type system: Generalized Typestate Checking for Data Structure Consistency (PL, VK, MCR), pp. 430–447.
PODS-2004-HershbergerS #adaptation #geometry #problem: Adaptive Sampling for Geometric Problems over Data Streams (JH, SS), pp. 252–262.
PODS-2004-SrivastavaW #flexibility: Flexible Time Management in Data Stream Systems (US, JW), pp. 263–274.
SIGMOD-2004-BoseF #xml: Data Stream Management for Historical XML Data (SB, LF), pp. 239–250.
SIGMOD-2004-CaiCPHWA #mining #named: MAIDS: Mining Alarming Incidents from Data Streams (YDC, DC, GP, JH, MW, LA), pp. 919–920.
SIGMOD-2004-WuSZ #online #sequence: Online Event-driven Subsequence Matching over Financial Data Streams (HW, BS, DZ), pp. 23–34.
SIGMOD-2004-ZhuRH #migration #query: Dynamic Plan Migration for Continuous Queries Over Data Streams (YZ, EAR, GTH), pp. 431–442.
VLDB-2004-AbadiLMS #framework #integration #network: An Integration Framework for Sensor Networks and Data Stream Management Systems (DJA, WL, SM, JS), pp. 1361–1364.
VLDB-2004-AggarwalHWY #clustering #framework: A Framework for Projected Clustering of High Dimensional Data Streams (CCA, JH, JW, PSY), pp. 852–863.
VLDB-2004-Fan #classification #concept #named: StreamMiner: A Classifier Ensemble-based Engine to Mine Concept-drifting Data Streams (WF), pp. 1257–1260.
VLDB-2004-KiferBG #detection: Detecting Change in Data Streams (DK, SBD, JG), pp. 180–191.
VLDB-2004-KochSSS #query #scheduling: Schema-based Scheduling of Event Processors and Buffer Minimization for Queries on Structured Data Streams (CK, SS, NS, BS), pp. 228–239.
VLDB-2004-LawWZ #database #modelling #query #sequence: Query Languages and Data Models for Database Sequences and Data Streams (YNL, HW, CZ), pp. 492–503.
VLDB-2004-MokbelXAHPH #named #query #realtime: PLACE: A Query Processor for Handling Real-time Spatio-temporal Data Streams (MFM, XX, WGA, SEH, SP, MAH), pp. 1377–1380.
VLDB-2004-SchmidtBL #named #query: QStream: Deterministic Querying of Data Streams (SS, HB, WL), pp. 1365–1368.
VLDB-2004-YuCLZ #mining #transaction: False Positive or False Negative: Mining Frequent Itemsets from High Speed Transactional Data Streams (JXY, ZC, HL, AZ), pp. 204–215.
ITiCSE-2004-ListerBMTW #education: The dimensions of variation in the teaching of data structures (RL, IB, BBM, JDT, SW), pp. 92–96.
ITiCSE-WGR-2004-NairM #approach #concept: Conceptualizing data structures: a pedagogic approach (ASN, TM), pp. 97–100.
ICALP-2004-FranceschiniG #string: A General Technique for Managing Strings in Comparison-Driven Data Structures (GF, RG), pp. 606–617.
IFM-2004-BeckertS #integer #refinement #verification: Software Verification with Integrated Data Type Refinement for Integer Arithmetic (BB, SS), pp. 207–226.
AFP-2004-Pardo04: Combining Datatypes and Effects (AP), pp. 171–209.
ICEIS-v1-2004-FuZ #memory management #scalability: Memory Management for Large Scale Data Stream Recorders (KF, RZ), pp. 54–63.
CIKM-2004-LvCL #image #similarity: Image similarity search with compact data structures (QL, MC, KL), pp. 208–217.
ICPR-v1-2004-LangeG #2d #effectiveness #recognition: Tree-Like Data Structures for Effective Recognition of 2-D Solids (ML, SG), pp. 592–595.
KDD-2004-AggarwalHWY #classification #on the: On demand classification of data streams (CCA, JH, JW, PSY), pp. 503–508.
KDD-2004-Fan #concept: Systematic data selection to mine concept-drifting data streams (WF), pp. 128–137.
ASE-2004-Andrews #case study #random #testing: Case Study of Coverage-Checked Random Data Structure Testing (JHA), pp. 316–319.
ICSE-2004-Francois #architecture #distributed #hybrid #parallel: A Hybrid Architectural Style for Distributed Parallel Processing of Generic Data Streams (ARJF), pp. 367–376.
SAC-2004-Ferrer-TroyanoAS: Discovering decision rules from numerical data streams (FJFT, JSAR, JCRS), pp. 649–653.
SAC-2004-JiangC: Data stream management system for MavHome (QJ, SC), pp. 654–655.
SAC-2004-OlteanuFB #performance #query #xml: An efficient single-pass query evaluator for XML data streams (DO, TF, FB), pp. 627–631.
DAC-2004-ShiB #automation #communication #fixpoint #optimisation: Automated fixed-point data-type optimization tool for signal processing and communication systems (CS, RWB), pp. 478–483.
HPDC-2004-ChenRA #distributed #middleware #named: GATES: A Grid-Based Middleware for Processing Distributed Data Streams (LC, KR, GA), pp. 192–201.
HPDC-2004-VijayakumarP #evaluation #performance: Performance Evaluation of Rate-Based Join Window Sizing for Asynchronous Data Streams (NNV, BP), pp. 260–261.
STOC-2004-Indyk #algorithm #geometry #problem: Algorithms for dynamic geometric problems over data streams (PI), pp. 373–380.
IJCAR-2004-ZhangSM #constraints #integer #recursion: Decision Procedures for Recursive Data Structures with Integer Constraints (TZ, HBS, ZM), pp. 152–167.
PODS-2003-BabcockDMO #maintenance: Maintaining variance and k-medians over data stream windows (BB, MD, RM, LO), pp. 234–243.
PODS-2003-GarofalakisK #correlation #distance #edit distance #using #xml: Correlating XML data streams using tree-edit distance embeddings (MNG, AK), pp. 143–154.
SIGMOD-2003-AbadiCCCCEGHMRSSTXYZ #named: Aurora: A Data Stream Management System (DJA, DC, UÇ, MC, CC, CE, EFG, MH, AM, AR, AS, MS, NT, YX, RY, SBZ), p. 666.
SIGMOD-2003-Aggarwal #framework: A Framework for Change Diagnosis of Data Streams (CCA), pp. 575–586.
SIGMOD-2003-BabcockBDM #memory management #scheduling: Chain : Operator Scheduling for Memory Minimization in Data Stream Systems (BB, SB, MD, RM), pp. 253–264.
SIGMOD-2003-DasGR #approximate: Approximate Join Processing Over Data Streams (AD, JG, MR), pp. 40–51.
SIGMOD-2003-OlstonJW #adaptation #distributed #query: Adaptive Filters for Continuous Queries over Distributed Data Streams (CO, JJ, JW), pp. 563–574.
SIGMOD-2003-Zeller #sql #transaction: NonStop SQL/MX Publish/Subscribe: Continuous Data Streams in Transaction Processing (HZ), p. 636.
VLDB-2003-AggarwalHWY #clustering #evolution #framework: A Framework for Clustering Evolving Data Streams (CCA, JH, JW, PSY), pp. 81–92.
VLDB-2003-CarneyCZRCS #scheduling: Operator Scheduling in a Data Stream Manager (DC, UÇ, AR, SBZ, MC, MS), pp. 838–849.
VLDB-2003-CormodeKMS: Finding Hierarchical Heavy Hitters in Data Streams (GC, FK, SM, DS), pp. 464–475.
VLDB-2003-GolabO #multi #query: Processing Sliding Window Multi-Joins in Continuous Queries over Data Streams (LG, MTÖ), pp. 500–511.
VLDB-2003-HammadFAE #scheduling: Scheduling for shared window joins over data streams (MAH, MJF, WGA, AKE), pp. 297–308.
VLDB-2003-KoudasS #query #tutorial: Data Stream Query Processing: A Tutorial (NK, DS), p. 1149.
VLDB-2003-TatbulCZCS: Load Shedding in a Data Stream Manager (NT, UÇ, SBZ, MC, MS), pp. 309–320.
VLDB-2003-TengCY #mining: A Regression-Based Temporal Pattern Mining Scheme for Data Streams (WGT, MSC, PSY), pp. 93–104.
VLDB-2003-WangZL #data mining #mining #named #sql: ATLAS: A Small but Complete SQL Extension for Data Mining and Data Streams (HW, CZ, CL), pp. 1113–1116.
ICALP-2003-GalM #complexity: The Cell Probe Complexity of Succinct Data Structures (AG, PBM), pp. 332–344.
ICALP-2003-Hannay #axiom #higher-order: Axiomatic Criteria for Quotients and Subobjects for Higher-Order Data Types (JEH), pp. 903–917.
ICALP-2003-Mutzel #graph: The SPQR-Tree Data Structure in Graph Drawing (PM), pp. 34–46.
TLCA-2003-Konecny #functional: Functional In-Place Update with Layered Datatype Sharing (MK), pp. 195–210.
ICFP-2003-Simonet #bound: An extension of HM(X) with bounded existential and universal data-types (VS), pp. 39–50.
ICEIS-v1-2003-ZimmermannFK #design #scalability: Design of a Large Scale Data Stream Recorder (RZ, KF, WSK), pp. 156–168.
CIKM-2003-ChangL #adaptation #monitoring #named #online: estWin: adaptively monitoring the recent change of frequent itemsets over online data streams (JHC, WSL), pp. 536–539.
CIKM-2003-JiangC #analysis #relational: Queueing analysis of relational operators for continuous data streams (QJ, SC), pp. 271–278.
CIKM-2003-JinQSYZ #maintenance: Dynamically maintaining frequent items over a data stream (CJ, WQ, CS, JXY, AZ), pp. 287–294.
ECIR-2003-CachedaCGV #hybrid #optimisation #strict #using #web: Optimization of Restricted Searches in Web Directories Using Hybrid Data Structures (FC, VC, CG, ÁV), pp. 436–451.
KDD-2003-ChangL #adaptation #online: Finding recent frequent itemsets adaptively over online data streams (JHC, WSL), pp. 487–492.
KDD-2003-GamaRM #mining #performance: Accurate decision trees for mining high-speed data streams (JG, RR, PM), pp. 523–528.
KDD-2003-GuhaGK #correlation: Correlating synchronous and asynchronous data streams (SG, DG, NK), pp. 529–534.
KDD-2003-WangFYH #classification #concept #mining #using: Mining concept-drifting data streams using ensemble classifiers (HW, WF, PSY, JH), pp. 226–235.
KDD-2003-ZhuS #detection #performance: Efficient elastic burst detection in data streams (YZ, DS), pp. 336–345.
OOPSLA-2003-DemskyR #automation #detection #fault: Automatic detection and repair of errors in data structures (BD, MCR), pp. 78–95.
AdaEurope-2003-Heaney #ada #library #named: Charles: A Data Structure Library for Ada95 (MH), pp. 271–282.
LOPSTR-2003-Ruiz-ReinaJHM #case study #performance #reasoning: Formal Reasoning about Efficient Data Structures: A Case Study in ACL2 (JLRR, JAAJ, MJH, FJMM), pp. 75–91.
POPL-2003-XiCC #recursion: Guarded recursive datatype constructors (HX, CC, GC), pp. 224–235.
PPDP-2003-Rossberg: Generativity and dynamic opacity for abstract types (AR), pp. 241–252.
SAS-2003-ChongR #recursion #static analysis: Static Analysis of Accessed Regions in Recursive Data Structures (SC, RR), pp. 463–482.
SAC-2003-Ferrer-TroyanoAS #mining #prototype: Prototype-based Mining of Numeric Data Streams (FJFT, JSAR, JCRS), pp. 480–484.
SAC-2003-GiraldezAS #performance: An Efficient Data Structure for Decision Rules Discovery (RG, JSAR, JCRS), pp. 475–479.
LDTA-2003-KortL #framework: A Framework for Datatype Transformation (JK, RL), pp. 463–482.
ESOP-2003-ReddyY #correctness #data transformation: Correctness of Data Representations Involving Heap Data Structures (USR, HY), pp. 223–237.
FASE-2003-AttiogbePS #diagrams #integration: Integration of Formal Datatypes within State Diagrams (CA, PP, GS), pp. 341–355.
FoSSaCS-2003-AbelMU #higher-order: Generalized Iteration and Coiteration for Higher-Order Nested Datatypes (AA, RM, TU), pp. 54–69.
CSL-2003-Khoussainov #algebra #on the #specification: On Algebraic Specifications of Abstract Data Types (BK), pp. 299–313.
SAT-2003-GentGNRT: Watched Data Structures for QBF Solvers (IPG, EG, MN, AGDR, AT), pp. 25–36.
PODS-2002-ArasuBBMW #memory management #query #requirements: Characterizing Memory Requirements for Queries over Continuous Data Streams (AA, BB, SB, JM, JW), pp. 221–232.
PODS-2002-BabcockBDMW #modelling: Models and Issues in Data Stream Systems (BB, SB, MD, RM, JW), pp. 1–16.
SIGMOD-2002-DobraGGR #query: Processing complex aggregate queries over data streams (AD, MNG, JG, RR), pp. 61–72.
SIGMOD-2002-GarofalakisGR #mining #query #tutorial: Querying and mining data streams: you only get one look a tutorial (MNG, JG, RR), p. 635.
VLDB-2002-ChenHWW #analysis #multi: Multi-Dimensional Regression Analysis of Time-Series Data Streams (YC, GD, JH, BWW, JW), pp. 323–334.
VLDB-2002-CormodeDIM #how #using: Comparing Data Streams Using Hamming Norms (How to Zero In) (GC, MD, PI, SM), pp. 335–345.
VLDB-2002-GarofalakisG #mining #query: Querying and Mining Data Streams: You Only Get One Look (MNG, JG).
VLDB-2002-KornMS #nearest neighbour: Reverse Nearest Neighbor Aggregates Over Data Streams (FK, SM, DS), pp. 814–825.
VLDB-2002-MankuM #approximate: Approximate Frequency Counts over Data Streams (GSM, RM), pp. 346–357.
VLDB-2002-ZhuS #monitoring #named #realtime #statistics: StatStream: Statistical Monitoring of Thousands of Data Streams in Real Time (YZ, DS), pp. 358–369.
ICALP-2002-BeierSS #energy #geometry #network #using: Energy Optimal Routing in Radio Networks Using Geometric Data Structures (RB, PS, NS), pp. 366–376.
ICALP-2002-CharikarCF: Finding Frequent Items in Data Streams (MC, KCC, MFC), pp. 693–703.
ICALP-2002-DuchM #multi #on the #orthogonal #performance: On the Average Performance of Orthogonal Range Search in Multidimensional Data Structures (AD, CM), pp. 514–524.
ICALP-2002-GuhaIMS #performance: Histogramming Data Streams with Fast Per-Item Processing (SG, PI, SM, MS), pp. 681–692.
ICFP-2002-MillsteinBC #composition: Modular typechecking for hierarchically extensible datatypes and functions (TDM, CB, CC), pp. 110–122.
CAiSE-2002-Wilson #information management #mobile: A High-Performance Data Structure for Mobile Information Systems (JNW), pp. 392–403.
CIKM-2002-QiaoAA #adaptation #named #summary: RHist: adaptive summarization over continuous data streams (LQ, DA, AEA), pp. 469–476.
ICPR-v2-2002-ChoCWS #adaptation #classification #image #learning #representation #robust: Robust Learning in Adaptive Processing of Data Structures for Tree Representation Based Image Classification (SYC, ZC, ZW, WCS), pp. 108–111.
ICPR-v2-2002-GuangmingJMHX #algorithm #fault #metric: A New Mesh Simplification Algorithm Combining Half-Edge Data Structure with Modified Quadric Error Metric (GL, JT, MZ, HH, XZ), pp. 659–658.
ASIA-PEPM-2002-ParkP #using: Using indexed data structures for program specialization (JGP, MSP), pp. 61–69.
PADL-2002-YangG #logic programming #performance #source code: Exploiting Efficient Control and Data Structures in Logic Programs (RY, SG), pp. 318–331.
PEPM-2002-LiuS #optimisation #recursion #using: Program optimization using indexed and recursive data structures (YAL, SDS), pp. 108–118.
PLDI-2002-ChilimbiH #source code: Dynamic Hot Data Stream Prefetching for General-Purpose Programs (TMC, MH), pp. 199–209.
SAS-2002-Jeannet #abstract interpretation #approximate #representation: Representing and Approximating Transfer Functions in Abstract Interpretation of Hetereogeneous Datatypes (BJ), pp. 52–68.
SAS-2002-Venet #alias #analysis #array #recursion: Nonuniform Alias Analysis of Recursive Data Structures and Arrays (AV), pp. 36–51.
SAC-2002-DingDP #classification #using: Decision tree classification of spatial data streams using Peano Count Trees (QD, QD, WP), pp. 413–417.
CC-2002-ZhangG: Data Compression Transformations for Dynamically Allocated Data Structures (YZ, RG), pp. 14–28.
HPDC-2002-Plale #memory management #runtime: Leveraging Run Time Knowledge about Event Rates to Improve Memory Utilization in Wide Area Data Stream Filtering (BP), pp. 171–178.
PDP-2002-KlauerEMW #architecture #automation #parallel #thread: The CDAG: A Data Structure for Automatic Parallelization for a Multithreaded Architecture (BK, FE, RM, KW), pp. 219–226.
STOC-2002-AjtaiJKS #approximate: Approximate counting of inversions in a data stream (MA, TSJ, RK, DS), pp. 370–379.
STOC-2002-SaksS #approximate #bound #distance: Space lower bounds for distance approximation in the data stream model (MES, XS), pp. 360–369.
CADE-2002-Ahrendt #deduction #fault #generative #specification #using: Deductive Search for Errors in Free Data Type Specifications Using Model Generation (WA), pp. 211–225.
LICS-2002-Reynolds #logic: Separation Logic: A Logic for Shared Mutable Data Structures (JCR), pp. 55–74.
SAT-2002-LynceM #backtracking #performance #satisfiability: Efficient data structures for backtrack search SAT solvers (IL, JMS), p. 20.
ECDL-2001-KholiefSM #architecture #library #retrieval: Architecture for Event-Based Retrieval from Data Streams in Digital Libraries (MK, SNTS, KM), pp. 300–311.
CSEET-2001-Cowling01a #algorithm #education #experience #java #re-engineering: Teaching Data Structures and Algorithms in a Software Engineering Degree: Some Experience with Java (AJC), pp. 247–257.
TLCA-2001-Jay #calculus: Distinguishing Data Structures and Functions: The Constructor Calculus and Functorial Types (CBJ), pp. 217–239.
ICFP-2001-ZengerO #algebra: Extensible Algebraic Datatypes with Defaults (MZ, MO), pp. 241–252.
GT-VMT-2001-EhrigO #concept #framework #integration #modelling #process: A Conceptual and Formal Framework for the Integration of Data Type and Process Modeling Techniques (HE, FO), pp. 199–226.
KDD-2001-HultenSD #mining: Mining time-changing data streams (GH, LS, PMD), pp. 97–106.
TOOLS-USA-2001-Li #on the: On ODMG Data Types (LL), pp. 219–228.
POPL-2001-IshtiaqO: BI as an Assertion Language for Mutable Data Structures (SSI, PWO), pp. 14–26.
POPL-2001-Sewell #distributed #version control: Modules, abstract types, and distributed versioning (PS), pp. 236–247.
PPDP-2001-GiavittoM #approximate #declarative: Declarative Definition of Group Indexed Data Structures and Approximation of Their Domains (JLG, OM), pp. 150–161.
ASE-2001-Erwig #source code: Programs Are Abstract Data Types (ME), pp. 400–403.
SAC-2001-GuPH #analysis #database #design #image #query: Design and analysis of data structures for querying image databases (YG, BP, KAH), pp. 236–241.
SAC-2001-GuptaMP #clustering #distributed #evaluation #performance #scalability: Performance evaluation of the LH*lh scalable, distributed data structure for a cluster of workstations (VG, MM, ADP), pp. 544–548.
DATE-2001-CichonB #network: Annotated data types for addressed token passing networks (GC, WB), p. 801.
PDP-2001-BaiardiGMMR #architecture #distributed #memory management: DVSA and SHOB: Support to Shared Data Structures on Distributed Memory Architectures (FB, DG, PM, LM, LR), pp. 165–172.
STOC-2001-NaorT #independence #named: Anti-presistence: history independent data structures (MN, VT), pp. 492–501.
CSL-2001-OHearnRY #reasoning #source code: Local Reasoning about Programs that Alter Data Structures (PWO, JCR, HY), pp. 1–19.
SIGMOD-2000-ForlizziGNS #database: A Data Model and Data Structures for Moving Objects Databases (LF, RHG, EN, MS), pp. 319–330.
SIGMOD-2000-LitwinS #distributed #scalability #using: LH*RS: A High-Availability Scalable Distributed Data Structure using Reed Solomon Codes (WL, TJES), pp. 237–248.
WCRE-J-1997-GirardK00 #comparison: A comparison of abstract data types and objects recovery techniques (JFG, RK), pp. 149–181.
IWPC-2000-GirardW #approach #classification #detection: Evaluating the Accessor Classification Approach to Detect Abstract Data Types (JFG, MW), pp. 87–95.
ICPR-v3-2000-ZhaMH #multi #using: Dynamic Control of Mesh LODs (Levels of Detail) by Using a Multiresolution Mesh Data Structure (HZ, YM, TH), pp. 3505–3509.
KDD-2000-CortesFPR #named: Hancock: a language for extracting signatures from data streams (CC, KF, DP, AR), pp. 9–17.
KDD-2000-DomingosH #mining #performance: Mining high-speed data streams (PMD, GH), pp. 71–80.
POPL-2000-LiblitA #distributed #type system: Type Systems for Distributed Data Structures (BL, AA), pp. 199–213.
PPDP-2000-Giavitto #framework #recursion: A framework for the recursive definition of data structures (JLG), pp. 45–55.
DAC-2000-EllerveeMCH: System-level data format exploration for dynamically allocated data structures (PE, MM, FC, AH), pp. 556–559.
HPCA-2000-KarlssonDS #linked data #open data: A Prefetching Technique for Irregular Accesses to Linked Data Structures (MK, FD, PS), pp. 206–217.
OSDI-2000-GribbleBHC #distributed #internet #scalability: Scalable, Distributed Data Structures for Internet Service Construction (SDG, EAB, JMH, DEC), pp. 319–332.
TACAS-2000-Wang #performance #realtime #verification: Efficient Data Structure for Fully Symbolic Verification of Real-Time Software Systems (FW), pp. 157–171.
VLDB-1999-BouganimCDDGS #data flow #multi #semistructured data #web: Miro Web: Integrating Multiple Data Sources through Semistructured Data Types (LB, TCSY, TTDN, JLD, GG, FS), pp. 750–753.
ITiCSE-1999-KopecCA #algorithm #how: How should data structures and algorithms be taught (DK, RC, JA), pp. 175–176.
ICALP-1999-GrossiI #linked data #maintenance #multi #open data #performance: Efficient Techniques for Maintaining Multidimensional Keys in Linked Data Structures (RG, GFI), pp. 372–381.
ICALP-1999-Vitter #memory management #online: Online Data Structures in External Memory (JSV), pp. 119–133.
IFM-1999-BoltonDW #on the #process #refinement #simulation: On the Refinement and Simulation of Data Types and Processes (CB, JD, JW), pp. 273–292.
TLCA-1999-Damiani #algebra #detection: Useless-Code Detection and Elimination for PCF with Algebraic Data types (FD), pp. 83–97.
TLCA-1999-PollZ #logic: A Logic for Abstract Data Types as Existential Types (EP, JZ), pp. 310–324.
ICEIS-1999-Bakker: Advantages of a Hierarchical Presentation of Data Structures (JAB), pp. 173–182.
ICEIS-1999-NishiokaKKON #inheritance: A High Speed Access Method to Data Structures with Inheritance Hierarchy (SN, FK, JK, MO, JN), pp. 509–516.
CIKM-1999-AllenS #library #metadata: Metadata and Data Structures for the Historical Newspaper Digital Library (RBA, JS), pp. 147–153.
PADL-1999-MossR #automation #benchmark #functional #metric: Automated Benchmarking of Functional Data Structures (GEM, CR), pp. 1–15.
CC-1999-RubinBR #recursion: Virtual Cache Line: A New Technique to Improve Cache Exploitation for Recursive Data Structures (SR, DB, MR), pp. 259–273.
CC-1999-SariavaS #compilation: Data Structure Free Compilation (JS, SDS), pp. 1–16.
DATE-1999-RadetzkiSPN #analysis #hardware #modelling #object-oriented #synthesis: Data Type Analysis for Hardware Synthesis from Object-Oriented Models (MR, AS, WPR, WN), p. 491–?.
HPDC-1999-IsertKSPE #distributed: Steering Data Streams in Distributed Computational Laboratories (CI, DK, KS, BP, GE), pp. 331–332.
ESOP-1999-BenediktRS #decidability #linked data #logic #open data: A Decidable Logic for Describing Linked Data Structures (MB, TWR, SS), pp. 2–19.
FASE-1999-Nepomniaschy #verification: Verification of Definite Iteration over Hierarchical Data Structures (VAN), pp. 176–187.
ITiCSE-1998-HabermanSS #development: Abstract data types as a project development organiser (BH, ZS, EYS), pp. 102–104.
LOPSTR-1998-AvelloneFM #source code #synthesis: Synthesis of Programs in Abstract Data Types (AA, MF, PM), pp. 81–100.
POPL-1998-Minamide #functional #representation: A Functional Representation of Data Structures with a Hole (YM), pp. 75–84.
SIGAda-1998-Duncan #ada #infinity #library #reuse: Reusable Ada Libraries Supporting Infinite Data Structures (AGD), pp. 89–103.
SIGAda-1998-JarcF #ada #algorithm #animation #empirical: An Empirical Study of Web-Based algorithm Animation Courseware in an Ada Data Structure Course (DJJ, MBF), pp. 68–74.
ASPLOS-1998-RothMS #linked data #open data: Dependance Based Prefetching for Linked Data Structures (AR, AM, GSS), pp. 115–126.
SIGMOD-1997-SeshadriP #named: PREDATOR: An OR-DBMS with Enhanced Data Types (PS, MP), pp. 568–571.
VLDB-1997-SeshadriLR: The Case for Enhanced Abstract Data Types (PS, ML, RR), pp. 66–75.
ITiCSE-1997-MeisaloST #education #named: CLAP: teaching data structures in a creative way (VM, ES, JT), pp. 117–119.
ITiCSE-1997-TheotokisGGP #education #interactive #named: VIBDaST: a virtual interactive book as a data structures teaching aid (DT, GG, PG, GP), pp. 111–113.
WCRE-1997-GirardKS #architecture #comparison #comprehension #detection #encapsulation: Comparison of Abstract Data Type and Abstract State Encapsulation Detection Techniques for Architectural Understanding (JFG, RK, GS), pp. 66–75.
ICALP-1997-Gianantonio: An Abstract Data Type for Real Numbers (PDG), pp. 121–131.
RTA-1997-KuhlerW #equation #induction #proving #specification #theorem proving: Conditional Equational Specifications of Data Types with Partial Operations for Inductive Theorem Proving (UK, CPW), pp. 38–52.
TLCA-1997-BerardiB #functional: Minimum Information Code in a Pure Functional Language with Data Types (SB, LB), pp. 30–45.
IFL-1997-MossR #benchmark #functional #metric #named: Auburn: A Kit for Benchmarking Functional Data Structures (GEM, CR), pp. 141–159.
ECOOP-1997-Almeida: Balloon Types: Controlling Sharing of State in Data Types (PSA), pp. 32–59.
POPL-1997-PaigeY #compilation: High Level Reading and Data Structure Compilation (RP, ZY), pp. 456–469.
ASE-1997-GirardKS #approach #detection: A Metric-based Approach to Detect Abstract Data Types and State Encapsulations (JFG, RK, GS), pp. 82–89.
PDP-1997-CateRV #approach #composition: A rigorous approach to the decomposition of data structures (HHtC, MRR, EAHV), pp. 281–288.
PDP-1997-LeeJH: A generalized conflict relation for abstract data types (SKL, SYJ, CSH), pp. 35–40.
STOC-1997-Micciancio #encryption: Oblivious Data Structures: Applications to Cryptography (DM), pp. 456–464.
CADE-1997-NieuwenhuisRV #algorithm #automation #deduction #kernel #named #similarity: Dedan: A Kernel of Data Structures and Algorithms for Automated Deduction with Equality Clauses (RN, JMR, MÁV), pp. 49–52.
ITiCSE-1996-Krone #algorithm #analysis #education #symbolic computation #using: Using symbolic computation for teaching data structures and algorithm analysis (JK), p. 230.
ITiCSE-1996-McNally #algorithm #education #using #visualisation: Using visualization in teaching data structures and algorithms (MFM), p. 231.
ICALP-1996-SchulzS #self: Self-Organizing Data Structures with Dependent Accesses (FS, ES), pp. 526–537.
AFP-1996-Okasaki96 #functional: Functional Data Structures (CO), pp. 131–158.
ICFP-1996-GostanzaPN #pattern matching: A New Look to Pattern Matching in Abstract Data Types (PPG, RP, MN), pp. 110–121.
ICFP-1996-Okasaki #evaluation #lazy evaluation: The Role of Lazy Evaluation in Amortized Data Structures (CO), pp. 62–72.
ICPR-1996-LittmannNP #detection #interactive #visual notation: Nonlinear interaction of ON and OFF data streams for the detection of visual structure (EL, HN, LP), pp. 540–544.
SEKE-1996-MagelZ #testing: Data Structure Coverage Testing (KIM, PZ), pp. 1–8.
ECOOP-1996-EngelsonFF #automation #generative #modelling #object-oriented #specification #user interface: Automatic Generation of User Interfaces From Data Structure Specifications and Object-Oriented Application Models (VE, DF, PF), pp. 114–141.
POPL-1996-FegarasS #embedded #morphism #source code: Revisiting Catamorphisms over Datatypes with Embedded Functions (or, Programs from Outer Space) (LF, TS), pp. 284–294.
SAC-1996-Liu #persistent #runtime #using: A persistent runtime system using persistent data structures (ZL), pp. 429–436.
ASPLOS-1996-LukM #recursion: Compiler-Based Prefetching for Recursive Data Structures (CKL, TCM), pp. 222–233.
CADE-1996-Sengler #algorithm #termination: Termination of Algorithms over Non-freely Generated Data Types (CS), pp. 121–135.
ICDAR-v2-1995-BippusM #database #documentation #generative #tool support: Data structures and tools for document database generation: an experimental system (RDB, VM), pp. 711–714.
FPLE-1995-NunezPP #functional #programming: A Second Year Course on Data Structures Based on Functional Programming (MN, PP, RP), pp. 65–84.
WCRE-1995-YehHR: Recovering Abstract Data Types and Object Instances from a Conventional Procedural Language (ASY, DRH, HBR), pp. 227–236.
TLCA-1995-Kondoh #equation: Basic Properties of Data Types with Inequational Refinements (HK), pp. 279–296.
SIGIR-1995-PfeiferF #approach #performance #query #using: Efficient Processing of Vague Queries using a Data Stream Approach (UP, NF), pp. 189–197.
ECOOP-1995-StroudW #protocol #using: Using Metaobject Protocols to Implement Atomic Data Types (RJS, ZW), pp. 168–189.
AdaEurope-1995-Kempe #ada #classification #semistructured data: Heterogeneous Data Structures and Cross-Classification of Objects with Ada95 (MK), pp. 71–80.
PEPM-1995-Deutsch #abstract interpretation #induction #modelling #pointer #semantics: Semantic models and abstract interpretation techniques for inductive data structures and pointers (AD), pp. 226–229.
PEPM-1995-Metayer #proving #recursion #source code: Proving Properties of Programs Defined over Recursive Data Structures (DLM), pp. 88–99.
PLDI-1995-PingaliB #dependence #named: APT: A Data Structure for Optimal Control Dependence Computation (KP, GB), pp. 32–46.
PLILP-1995-Mohnen #garbage collection #performance: Efficient Compile-Time Garbage Collection for Arbitrary Data Structures (MM), pp. 241–258.
KBSE-1995-Richardson #automation #functional #source code: Automating Changes of Data Type in Functional Programs (JR), pp. 166–173.
SAC-1995-Gibson #algorithm #multi #optimisation #problem #search-based: A genetic algorithm for optimizing problems with multiple disparate data types (GMG), pp. 300–304.
SAC-1995-NugrohoS #music #persistent: Persistence in music data structures (LEN, ASMS), pp. 27–31.
SAC-1995-Scholz #concurrent #functional #programming language: Turning a functional data type into a concurrent programming language (ES), pp. 135–139.
ASF+SDF-1995-MauwM #library: A PSF Library of Data Types (SM, JCM), pp. 53–64.
PDP-1995-StuartW #algorithm #named #parallel #prototype #visual notation: PAVE: parallel algorithms visually explored, a prototype tool for the investigation of data structures in parallel numerical iterative algorithms (EJS, JSW), pp. 522–528.
PPoPP-1995-GotwalsSG #distributed #library: pC++/streams: a Library for I/O on Complex Distributed Data Structures (JG, SS, DG), pp. 11–18.
STOC-1995-FerraginaG #string: A fully-dynamic data structure for external substring search (PF, RG), pp. 693–702.
STOC-1995-MiltersenNSW #communication #complexity #on the #symmetry: On data structures and asymmetric communication complexity (PBM, NN, SS, AW), pp. 103–111.
TAPSOFT-1995-Baumeister #algebra: Relations as Abstract Datatypes: An Institution to Specify Relations between Algebras (HB), pp. 756–771.
VLDB-1994-LitwinNS #distributed #order #product line #scalability: RP*: A Family of Order Preserving Scalable Distributed Data Structures (WL, MAN, DAS), pp. 342–353.
ICSM-1994-CanforaCTM #identification #precise #reuse: A Precise Method for Identifying Reusable Abstract Data Types in Code (GC, AC, MT, MM), pp. 404–413.
LFP-1994-HuelsbergenLA #runtime #thread #using: Using the Run-Time Sizes of Data Structures to Guide Parallel-Thread Creation (LH, JRL, AA), pp. 79–90.
CAiSE-1994-SeoL #formal method #process #reuse #using: Formalisation of Data and Process Model Reuse Using Hierarchic Data Types (DS, PL), pp. 256–268.
AdaEurope-1994-BarbeyB #ada #specification #testing #using: Testing Ada Abstract Data Types Using Formal Specifications (SB, DB), pp. 76–89.
AdaEurope-1994-SotirovskiJK: Beyond Abstract Data Types: Giving Life to Objects (DMS, SSJ, PK), pp. 111–120.
LOPSTR-1994-MarakakisG #design #logic programming #source code #top-down #using: Schema-Based Top-Down Design of Logic Programs Using Abstract Data Types (EIM, JPG), pp. 138–153.
PLDI-1994-HummelHN #data flow #dependence #pointer: A General Data Dependence Test for Dynamic, Pointer-Based Data Structures (JH, LJH, AN), pp. 218–229.
TRI-Ada-1994-Kempe #ada: Abstract Data Types are Under Full Control with Ada 9X (MK), pp. 141–152.
FSE-1994-BatoryTS #compilation #re-engineering #scalability #using: Reengineering a Complex Application Using a Scalable Data Structure Compiler (DSB, JT, MS), pp. 111–120.
FSE-1994-BowdidgeG #automation #encapsulation: Automated Support for Encapsulating Abstract Data Types (RWB, WGG), pp. 97–110.
KBSE-1994-DekkerV #recognition: Abstract Data Structure Recognition (RD, FV), pp. 133–140.
SAC-1994-KaraliH #parallel #prolog: Abstract data type support in Prolog and its relation to parallelism (IK, CH), pp. 415–419.
STOC-1994-Rauch: Improved data structures for fully dynamic biconnectivity (MR), pp. 686–695.
PODS-1993-PagelSTW #analysis #performance #query #towards: Towards an Analysis of Range Query Performance in Spatial Data Structures (BUP, HWS, HT, PW), pp. 214–221.
CSM-1993-CanforaCMT #c #case study #source code: Extracting Abstract Data Types from C Programs: A Case Study (GC, AC, MM, CJT), pp. 200–209.
WCRE-1993-CanforaCM #identification #reuse #reverse engineering: A Reverse Engineering Method for Identifying Reusable Abstract Data Types (GC, AC, MM), pp. 73–82.
CIKM-1993-ZhangOCF #optimisation #query #using: A Method of Using Semijoins to Optimizing Queries with ADT Functions (XZ, NO, HC, YF), pp. 723–725.
TOOLS-USA-1993-RupingWZ #design: Demonstrating Coherent Design: A Data Structure Catalogue (AR, FW, WZ), pp. 363–375.
PLDI-1993-AdamsCS: First-Class Data-Type Representations in SchemeXerox (NA, PC, MS), pp. 139–146.
WSA-1993-Benton #algebra #lazy evaluation #strict: Strictness Properties of Lazy Algebraic Datatypes (PNB), pp. 206–217.
FSE-1993-Turpin #approach #logic: A Logical Approach to Data Structures (RT), pp. 138–148.
ICSE-1993-SirkinBS #component: Software Components in a Data Structure Precompiler (MS, DSB, VS), pp. 437–446.
DAC-1993-LaiFW #performance #query: HV/VH Trees: A New Spatial Data Structure for Fast Region Queries (GGL, DSF, DFW), pp. 43–47.
STOC-1993-CohenBKT #query: Reinventing the wheel: an optimal data structure for connectivity queries (RFC, GDB, AK, RT), pp. 194–200.
CSL-1993-Raffalli #infinity #similarity: Data Types, Infinity and Equality in System AF2 (CR), pp. 280–294.
PODS-1992-TurekSP #algorithm #concurrent: Locking without Blocking: Making Lock Based Concurrent Data Structure Algorithms Nonblocking (JT, DS, SP), pp. 212–222.
SIGMOD-1992-HoelS #comparison #database #scalability: A Qualitative Comparison Study of Data Structures for Large Line Segment Databases (EGH, HS), pp. 205–214.
PLDI-1992-HendrenHN #abstraction #analysis #imperative #pointer #recursion #source code: Abstractions for Recursive Pointer Data Structures: Improving the Analysis of Imperative Programs (LJH, JH, AN), pp. 249–260.
PLILP-1992-GomardS #analysis #lazy evaluation: Path Analysis for Lazy Data Structures (CKG, PS), pp. 54–68.
WSA-1992-Jensen #axiom #recursion: Axiomatising Uniform Properties of Recursive Data Structures (TPJ), pp. 144–151.
KBSE-1992-CohenC #automation #composition: Automatic Composition of Data Structures to Represent Relations (DC, NC), p. 26.
CC-1992-Samples #compilation #implementation #using: Compiler Implementation of ADTs Using Profile Data (ADS), pp. 72–87.
IWPTS-1992-Gaudel #specification #testing: Test Selection Based on ADT Specifications (MCG), pp. 31–40.
LICS-1992-Curien #algorithm: Observable Algorithms on Concrete Data Structures (PLC), pp. 432–443.
VLDB-1991-Albert #algebra: Algebraic Properties of Bag Data Types (JA), pp. 211–219.
VLDB-1991-SullivanS #database #fault tolerance #using: Using Write Protected Data Structures To Improve Software Fault Tolerance in Highly Available Database Management Systems (MS, MS), pp. 171–180.
CAV-1991-Brinksma #process: From Data Structure to Process Structure (EB), pp. 244–254.
CSL-1991-Feferman #approach: A New Approach to Abstract Data Types II: Computation on ADTs as Ordinary Computation (SF), pp. 79–95.
CSL-1991-Meinke #combinator #equation #specification: Equational Specification of Abstract Types and Combinators (KM), pp. 257–271.
PODS-1990-ArefS #performance #query: Efficient Processing of Window Queries in The Pyramid Data Structure (WGA, HS), pp. 265–272.
ICALP-1990-NaherM #algorithm #library #named #performance: LEDA: A Library of Efficient Data Types and Algorithms (SN, KM), pp. 1–5.
ICALP-1990-TuckerWZ: Provable Computable Functions on Abstract Data Types (JVT, SSW, JIZ), pp. 660–673.
VDME-1990-Steensgaard-Madsen: Adding Abstract Datatypes to Meta-IV (JSM), pp. 233–243.
SEKE-1990-MatetiD #diagrams #linked data #open data: Aesthetics Rules in The Diagrams of Linked Data Structures (PM, CD), pp. 239–244.
PLILP-1990-Huitouze #implementation #prolog: A New Data Structure for Implementing Extensions to Prolog (SLH), pp. 136–150.
DAC-1990-WhitcombN #synthesis: Abstract Data Types and High-Level Synthesis (GSW, ARN), pp. 680–685.
PPoPP-1990-Herlihy #concurrent #implementation: A Methodology for Implementing Highly Concurrent Data Structures (MH), pp. 197–206.
PPoPP-1990-KoelbelMR #architecture #distributed #memory management: Supporting Shared Data Structures on Distributed Memory Architectures (CK, PM, JVR), pp. 177–186.
CLP-1990-MulkersWB90 #analysis: Analysis of Shared Data Structures for Compile-Time Garbage (AM, WHW, MB), pp. 747–762.
SEI-1989-Collberg #algorithm #re-engineering: Data Structures, Algorithms, and Software Engineering (CSC), pp. 70–79.
ICALP-1989-GambosiNT: A Pointer-Free Data Structure for Merging Heaps and Min-Max Heaps (GG, EN, MT), pp. 405–422.
ICALP-1989-Kenyon-MathieuV #analysis: General Methods for the Analysis of the Maximum Size of Dynamic Data Structures (CKM, JSV), pp. 473–487.
ICSE-1989-JadoulDP #agile #algebra #prototype #specification: An Algebraic Data Type Specification Language and Its Rapid Prototyping Environment (LJ, LD, WVP), pp. 74–84.
CAAP-1989-MiglioliMO #axiom: Semi-Constructive Formal Systems and Axiomatization of Abstract Data Types (PM, UM, MO), pp. 337–351.
CCIPL-1989-PenaA #specification #verification: Specification and Verification of TCSP Systems by Means of Partial Abstract Data Types (RP, LMA), pp. 328–344.
STOC-1989-AwerbuchBLP #adaptation #distributed: Compact Distributed Data Structures for Adaptive Routing (BA, ABN, NL, DP), pp. 479–489.
STOC-1989-FredmanS #complexity: The Cell Probe Complexity of Dynamic Data Structures (MLF, MES), pp. 345–354.
PODS-1988-HerlihyW #concurrent #hybrid: Hybrid Concurrency Control for Abstract Data Types (MH, WEW), pp. 201–210.
VLDB-1988-LinnemannKDPEKSWW #database #design #implementation: Design and Implementation of an Extensible Database Management System Supporting User Defined Data Types and Functions (VL, KK, PD, PP, RE, AK, NS, GW, MW), pp. 294–305.
ICALP-1988-Tamassia #graph: A Dynamic Data Structure for Planar Graph Embedding (RT), pp. 576–590.
ALP-1988-BeierleP #equation #logic programming #specification: Integrating Logic Programming and Equational Specification of Abstract Data Types (CB, UP), pp. 71–82.
POPL-1988-GarlandG #induction #reasoning: Inductive Methods for Reasoning about Abstract Data Types (SJG, JVG), pp. 219–228.
ICSE-1988-EmbleyW #ada #quality: Assessing the Quality of Abstract Data Types Written in Ada (DWE, SNW), pp. 144–153.
DAC-1988-Meyer: A Data Structure for Circuit Net Lists (SM), pp. 613–616.
SIGMOD-1987-NelsonS #analysis: A Population Analysis for Hierarchical Data Structures (RCN, HS), pp. 270–277.
VDME-1987-Airchinnigh87b #specification: Specification by Data Types (MMaA), pp. 362–388.
PLDI-1987-ShebsK #automation #design #implementation: Automatic design and implementation of language data types (SS, RRK), pp. 26–37.
POPL-1987-MoshierR #logic: A Logic for Partially Specified Data Structures (MDM, WCR), pp. 156–167.
ESEC-1987-EnselmeBV #automation #synthesis: Automatic Program Synthesis from Data Structures (DE, GB, FYV), pp. 339–347.
ICSE-1987-EmbleyW #reuse: A Knowledge Structure for Reusing Abstract Data Types (DWE, SNW), pp. 360–368.
ICSE-1987-Kramer #distributed #named #petri net #specification: SEGRAS — A Formal and Semigraphical Language Combining Petri Nets and Abstract Data Types for the Specification of Distributed Systems (BJK), pp. 116–125.
SOSP-1987-VargheseL #implementation #performance: Hashed and Hierarchical Timing Wheels: Data Structures for the Efficient Implementation of a Timer Facility (GV, AL), pp. 25–38.
CAAP-1987-MarongiuT #algebra #finite #specification: Finite Algebraic Specifications of Semicomputable Data Types (GM, ST), pp. 111–122.
CFLP-1987-BeierleV #canonical #specification #theory and practice: Theory and Practice of Canonical Term Functors in Abstract Data Type Specifications (CB, AV), pp. 320–334.
CFLP-1987-Thomas #algebra #imperative #implementation #programming language: Implementing Algebraically Specified Abstract Data Types in an Imperative Programming Language (MT), pp. 197–211.
SLP-1987-BarklundM87 #prolog: Integrating Complex Data Structures in Prolog (JB, HM), pp. 415–425.
OOPSLA-1986-Olthoff #concept #experience #object-oriented #programming #type system: Augmentation of Object-Oriented Programming by Concepts of Abstract Data Type Theory: The ModPascal Experience (WGO), pp. 429–443.
POPL-1986-CarrieroGL #distributed: Distributed Data Structures in Linda (NC, DG, JL), pp. 236–242.
DAC-1986-Larsen #analysis #clustering #synthesis: Rules-based object clustering: a data structure for symbolic VLSI synthesis and analysis (RPL), pp. 768–777.
STOC-1986-DriscollSST #persistent: Making Data Structures Persistent (JRD, NS, DDS, RET), pp. 109–121.
CADE-1986-Buttner #set #unification: Unification in the Data Structure Sets (WB), pp. 470–488.
POPL-1985-MitchellP: Abstract Types Have Existential Type (JCM, GDP), pp. 37–51.
DAC-1985-ZaraRNS #automaton #functional #modelling: An abstract machine data structure for non-procedural functional models (RVZ, KR, GN, HS), pp. 753–756.
CAAP-1985-KapurS #approach #rule-based: A Rewrite Rule Based Approach for Synthesizing Abstract Data Types (DK, MKS), pp. 188–207.
CAAP-1985-Padawitz #parametricity #specification: Parameter Preserving Data Type Specifications (PP), pp. 323–341.
CAAP-1985-PoigneV #implementation #on the #programming language: On the Implementation of Abstract Data Types by Programming Language Constructs (AP, JV), pp. 388–402.
CSE-1985-HsiangS #prolog #reasoning: A PROLOG Environment for Developing and Reasoning about Data Types (JH, MKS), pp. 276–293.
CSE-1985-MaibaumVS #development #formal method #question: A Theory of Abstract Data Types for Program Development: Bridging the Gap? (TSEM, PASV, MRS), pp. 214–230.
PODS-1984-OrensteinM: A Class of Data Structures for Associative Searching (JAO, THM), pp. 181–190.
SIGMOD-1984-StonebrakerAHR: Quel as a Data Type (MS, EA, ENH, WBR), pp. 208–214.
VLDB-1984-BatoryB #framework #modelling: Molecular Objects, Abstract Data Types, and Data Models: A Framework (DSB, APB), pp. 172–184.
POPL-1984-Myers #performance: Efficient Applicative Data Types (EWM), pp. 66–75.
POPL-1984-Thiel #semistructured data #specification: Stop Losing Sleep Over Incomplete Data Type Specifications (JJT), pp. 76–82.
STOC-1984-FredericksonS #online: Data Structures for On-Line Updating of Matroid Intersection Solutions (GNF, MAS), pp. 383–390.
CADE-1984-Kirchner84a #algorithm #induction: A General Inductive Completion Algorithm and Application to Abstract Data Types (HK), pp. 282–302.
ICALP-1983-Ganzinger #compilation #composition #semantics: Modular Compiler Descriptions Based on Abstract Semantic Data Types (HG), pp. 237–249.
ICALP-1983-LescanneS #case study #on the: On the Study Data Structures: Binary Tournaments with Repeated Keys (PL, JMS), pp. 466–477.
ICALP-1983-MunroP: Searchability in Merging and Implicit Data Structures (JIM, PVP), pp. 527–535.
POPL-1983-Kieburtz #precise #specification #type system: Precise Typing of Abstract Data Type Specifications (RBK), pp. 109–116.
POPL-1983-Leivant83a #polymorphism #semantics: Structural Semantics for Polymorphic Data Types (DL), pp. 155–166.
RE-1983-PartschP: Abstract Data Types as a Tool for Requirement Engineering (HP, PP), pp. 42–55.
DAC-1983-LoNB: A data structure for MOS circuits (CYL, HNN, AKB), pp. 619–624.
STOC-1983-Frederickson #online: Data Structures for On-Line Updating of Minimum Spanning Trees (GNF), pp. 252–257.
VLDB-1982-SchekP #database #information retrieval: Data Structures for an Integrated Data Base Management and Information Retrieval System (HJS, PP), pp. 197–207.
ICALP-1982-BergstraK #algebra #parametricity #specification: Algebraic Specifications for Parametrized Data Types with Minimal Parameter and Target Algebras (JAB, JWK), pp. 23–34.
ICALP-1982-Salwicki #algorithm: Algorithmic Theories of Data Structures (AS), pp. 458–472.
POPL-1982-JonesM #analysis #approach #data flow #flexibility #interprocedural #recursion #source code: A Flexible Approach to Interprocedural Data Flow Analysis and Programs with Recursive Data Structures (NDJ, SSM), pp. 66–74.
POPL-1982-Komorowski #implementation #partial evaluation #prolog: Partial Evaluation as a Means for Inferencing Data Structures in an Applicative Language: A Theory and Implementation in the Case of Prolog (HJK), pp. 255–267.
ICSE-1982-SakabeIH #specification: Specification of Abstract Data Types with Partially Defined Operations (TS, YI, NH), pp. 218–224.
DAC-1982-Grabel #distributed #towards: Object data structures towards distributed graphics processing (DG), pp. 358–364.
DAC-1982-Kedem #algorithm #online: The quad-CIF tree: A data structure for hierarchical on-line algorithms (GK), pp. 352–357.
DAC-1982-Peled: Simplified data structure for “mini-based” turnkey CAD systems (JP), pp. 636–642.
CADE-1982-MatwinP #backtracking #exponential #implementation #performance: Exponential Improvement of Efficient Backtracking: data Structure and Implementation (SM, TP), pp. 240–259.
ICALP-1981-Loeckx #algorithm #specification: Algorithmic Specifications of Abstract Data Types (JL), pp. 129–147.
ICALP-1981-Subrahmanyam #nondeterminism: Nondeterminism in Abstract Data Types (PAS), pp. 148–164.
PS-1981-Cristian #robust: Robust Data Types (FC), pp. 215–254.
ICSE-1981-AndrewsDD: Active Data Structures (GRA, DPD, PJD), pp. 354–362.
ICSE-1981-CunhaM #programming: Resource = Abstract Data Type + Synchronization — A Methodology for Message Oriented Programming (PRFC, TSEM), pp. 263–272.
ICSE-1981-SchwartzM: The Finalization Operation for Abstract Types (RLS, PMMS), pp. 273–282.
DAC-1981-HirschhornHB #algorithm #functional #simulation: Functional level simulation in FANSIM3 — algorithms, data structures and results (SH, MH, CB), pp. 248–255.
DAC-1981-LacroixP: Data structures for CAD object description (ML, AP), pp. 653–659.
STOC-1981-SleatorT: A Data Structure for Dynamic Trees (DDS, RET), pp. 114–122.
ICALP-1980-BergstraT #equation #finite #specification: A Characterisation of Computable Data Types by Means of a Finite Equational Specification Method (JAB, JVT), pp. 76–90.
ICALP-1980-EhrigKP #algebra #concept #correctness #implementation #semantics #syntax: Algebraic Implementation of Abstract Data Types: Concept, Syntax, Semantics and Correctness (HE, HJK, PP), pp. 142–156.
ICALP-1980-EhrigKTWW #algebra #specification: Parameterized Data Types in Algebraic Specification Languages (HE, HJK, JWT, EGW, JBW), pp. 157–168.
ICALP-1980-HornungR #algebra #semantics: Terminal Algebra Semantics and Retractions for Abstract Data Types (GH, PR), pp. 310–323.
LISP-1980-Cartwright #axiom: A Constructive Alternative to Axiomatic Data Type Definitions (RC), pp. 46–55.
POPL-1980-DemersD #parametricity #type checking: Data Types, Parameters, and Type Checking (AJD, JED), pp. 12–23.
POPL-1980-Kamin #specification: Final Data Tye Specifications: A New Data Type Specification Method (SNK), pp. 131–138.
POPL-1980-Musser #induction #on the #proving: On Proving Inductive Properties of Abstract Data Types (DRM), pp. 154–162.
DAC-1980-Jayakumar #interactive: A data structure for interactive placement of rectangular objects (VJ), pp. 237–242.
DAC-1980-Lauther: A data structure for gridless routing (UL), pp. 603–609.
SDCG-1980-Gaudel #compilation #specification: Specification of compilers as abstract data type representations (MCG), pp. 140–164.
CADE-1980-OverbeekL #architecture #implementation #source code: Data Structures and Control Architectures for Implementation of Theorem-Proving Programs (RAO, ELL), pp. 232–249.
ICALP-1979-BroyDPPW #quantifier: Existential Quantifiers in Abstract Data Types (MB, WD, HP, PP, MW), pp. 73–87.
FM-1979-BergG #specification: Hierarchical Specification of Abstract Data Types (HKB, WKG), pp. 150–196.
POPL-1979-SchonbergSS #automation: Automatic Data Structure Selection in SETL (ES, JTS, MS), pp. 197–210.
STOC-1979-Fredman #problem #query: A Near Optimal Data Structure for a Type of Range Query Problem (MLF), pp. 62–66.
STOC-1979-MunroS: Implicit Data Structures (JIM, HS), pp. 108–117.
STOC-1979-RosenbergWG: Storage Representations for Tree-Like Data Structures (ALR, DW, ZG), pp. 99–107.
VLDB-1978-BrodieS #question #what: What is the Use of Abstract Data Types? (MLB, JWS), pp. 140–141.
ICALP-1978-EhrigKP #implementation #specification: Stepwise Specification and Implementation of Abstract Data Types (HE, HJK, PP), pp. 205–226.
GG-1978-EhrichL #specification: Constructive Specifications of Abstract Data Types by Replacements (HDE, VGL), pp. 180–191.
POPL-1978-DemersDS #encapsulation #morphism #polymorphism: Data Types as Values: Polymorphism, Type-Checking, Encapsulation (AJD, JED, GS), pp. 23–30.
POPL-1978-Oppen #reasoning #recursion: Reasoning about Recursively Defined Data Structures (DCO), pp. 151–157.
STOC-1978-ThatcherWW #power of #specification: Data Type Specification: Parameterization and the Power of Specification Techniques (JWT, EGW, JBW), pp. 119–132.
VLDB-1977-MizumotoT #implementation: Implementation of a Fuzzy-Set Theoretic Data Structure System (MM, MU, KT), p. 490.
ICALP-1977-Rajlich #graph grammar #relational: Theory of Data Structures by Relational and Graph Grammars (VR), pp. 391–411.
ICALP-1977-ShamirW: Data Types as Objects (AS, WWW), pp. 465–479.
VLDB-1976-Bekke #relational: A Data Manipulation Language for Relational Data Structures (JHtB), pp. 159–168.
ICALP-1976-Cartwright #lisp #source code #verification: User-Defined Data Types as an Aid to Verifying LISP Programs (RC), pp. 228–256.
DIPL-1976-Brosgol #type checking: Some issues in data types and type checking (BMB), pp. 102–130.
DIPL-1976-DemersDTW #encapsulation: Encapsulated data types and generic (AJD, JED, RTT, JHW), pp. 171–214.
DIPL-1976-Nestor #modelling: Models of data objects and data types (JRN), pp. 131–170.
POPL-1976-LowR #automation: Techniques for the Automatic Selection of Data Structures (JRL, PR), pp. 58–67.
ICSE-1976-BillawalaST #multi #simulation: A Data Structure and Drive Mechanism for a Table-Driven Simulation System Employing Multilevel Structural Representations of Digital Systems (NB, SAS, EWT), pp. 151–157.
ICSE-1976-Claybrook #design: The Design of a Template Structure for a Generalized Data Structure Definition Facility (BGC), pp. 408–413.
ICSE-1976-GuttagHM #design #specification: The Design of Data Type Specifications (JVG, EH, DRM), pp. 414–420.
SIGMOD-1975-Gerritsen #design: A Preliminary System for the Design of DBTG Data Structures (RG), p. 166.
SIGMOD-1975-McGee #network: File-Level Operations on Network Data Structures (WCM), pp. 32–47.
VLDB-1975-Senko #specification: Specification of Stored Data Structures and Desired Output Results in DIAM II with FORAL (MES), pp. 557–571.
POPL-1975-CookO: An Assertion Language for Data Structures (SAC, DCO), pp. 160–166.
POPL-1975-Schwartz #automation: Automatic Data Structure Choice in a Language of Very High Level (JTS), pp. 36–40.
STOC-1975-LiptonED #complexity: The Complexity of Control Structures and Data Structures (RJL, SCE, RAD), pp. 186–193.
STOC-1975-OppenC #proving #source code: Proving Assertions about Programs that Manipulate Data Structures (DCO, SAC), pp. 107–116.
POPL-1973-LewisR #recursion: Recursively Defined Data Types (CHL, BKR), pp. 125–138.
SIGFIDET-1972-WalkerG #hybrid: Hybrid Trees: A Data Structure for Lists of Keys (WAW, CCG), pp. 189–211.
SIGFIDET-1971-Codd71a #normalisation #tutorial: Normalized Data Structure: A Brief Tutorial (EFC), pp. 1–17.
SIGFIDET-1970-BracchiFS #multi: A Multilevel Data Structure for Complex Hierarchies of Interrelated Data (GB, DF, MS), pp. 246–275.
SIGFIDET-1970-Earley #comprehension #towards: Toward an Understanding of Data Structures (JE), pp. 1–40.
SHARE-1966-Robinson #design: A data structure for a computer aided design system (CER).
LISP-1963-Hawkinson #lisp: Data structures and arrangements in LISP (LH), p. 5.